Thread: Want to be sure.

How hard is it to implent bubble sort on
a single linked list ?

By hard I mean, that we will have to write diffrent
code for each private case. Like if the list contains
only two juctions and other case if more. A case for dealing with the head . etc.



Just to be sure that we are talking on the same things
here is a bubble sort on an array :

Code:

void  bubble_sort(int  arr[], int sarr)
{
int  i , j;


for ( i = 0 ; i < sarr - 1 ; ++i )
    for ( j = sarr-1 ; j > i ; --j )
        if ( arr[j] < arr[j-1] )
           swap(arr+j, arr+j-1);
}

By saying "single linked list." Im mean that I have
only one pointer for the next junction. ( there is no
prev pointer).

It shouldn't be too hard to implement a bubble sort of singly linked lists. Have a pointer that keeps the previous element of the loop and one that keeps the current element, that way you can compare the current and previous elements like your code did

if ( arr[j] < arr[j-1] )

I'm assuming this what troubled you the most. Don't forget to remap what the elements next-pointer points to either.