Member Avatar for 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;
}
  • 2 Contributors
  • 3 Replies
  • 137 Views
  • 6 Hours Discussion Span
  • Latest Post Latest Post by deceptikon

Recommended Answers

All 3 Replies

Member Avatar for deceptikon

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

Member Avatar for rithish

why will time complexity go too much????

Member Avatar for deceptikon

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

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.