I’m pleased to publish this insertion sort implementation on single linked lists developed with my collegue Rigel.
It’s a nice experiment in asymptotic complexity of O(n^3). The high complexity is due to the necessity of retrieving the neighbours of the node handled, a difficult operation when using single linked lists.
Download: Insertion Sort on Single Linked Lists
As assignment for Data Structures and Algorithms course, we had to work with a modified version of the quicksort algorithm. It came obvious that for modifying a qsort you need to implement it 
It is difficult to find a clear quicksort algorithm implemented, so I wrote it.
Here is the generic C implementation of the Quicksort Algorithm, which sorts an array in place, following the Divide And Conquer design.
Download: quicksort qsort in C language
Interesting methods (look at the source code for comments):
void quicksort( int A[], int left, int right){
int m;
if( left < right ) {
m = partition( A, left, right);
quicksort( A, left, m-1);
quicksort( A, m+1, right);
}
}
As you see, there is nothing optimized in this implementation. It just looks elegant and easy to be understood.
If you would like to have a more optimized version of this algorithm, take a look at this one.
Today I wrote a new version of my summary posted here. The new version covers more topics, here is the updated list:
