Insertion Sort on Linked Lists

April 9th, 2008

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

Tags: , , , , , , , , ,

This entry was posted on Wednesday, April 9th, 2008 at 11:57 and is filed under Programming. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

«
»

One Response to “Insertion Sort on Linked Lists”

  1. Manuel Says:
    April 9th, 2008 at 12:05

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

Leave a Reply