Insertion Sort on Linked Lists

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

Share and Enjoy:

Related posts

2008
04/09
CATEGORY
Programming
TAGS









1 comment

  1. As I already said…
    It’s a quite useless algorithm.. but we developed it, so we have to be quite proud anyway ;D

  1. No trackbacks yet.

Twitter