2 replies to this topic

[ghostrider_]

i want to sort a linked list in c..

i have understood the algorithm but it seems i am having problems with the code..

i am trying mergesort..any help?

[julmuri]

You should try bubble sort.
Merge sort works best when you have random access.

[Ancient Dragon]

When sorting lists its best to swap the data in the nodes, not the nodes themselves because its just easier, especially if you put all data in a structure then have the structure in the node. For example

struct data
{
    char last_name[20];
    char first_name[20];
    char street_address[40];
    char city[20];
};

struct node
{
   struct node *next;
   struct node *previous;
   struct data d;
};

Now in your program when a swap is needed all you have to do is swap the data structures instead of the next and previous pointers.