sorting using linked list

[rithish]

just tell me will this sorting algorithm work out in linked list

for(i=head;i!=null;i=i->next)

for(j=i->next;j!=null;j=j->next)

if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}

[deceptikon]

The concept is sound, but super inefficient due to the overhead of chasing pointers.

[rithish]

why will time complexity go too much????

[deceptikon]

Time complexity doesn't change, but the overhead of individual operations changes noticeably between array indexing and link chasing.