Insertion Sort on Linked Lists
April 9th, 2008I'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: Download, Experiment, HTTP, java, javascript, link, list, page, pageTracker, php
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