I need someone to fresh up my memory here since I don't have any of my algorithm books around.

I have a small array, about 144 pointer (32bits each). So this is NOT much data. And an other importent thing is that the data in the array will always NEARLY be sorted before you start. I guess that is importent info since sorting algorithms as Quicksort has it's worst case when the array is nearl sorted.


So can anyone enlighten me a bit on what algo would be the fastest on this tiny array that is all ready nearly sorted?

Thanks
- ØØ