Talk:Shell sort
|
|
This sounds like it might have been taken straight from a copyrighted textbook. Anyone know the source for sure? Wesley
- I found a german version which seems to be a word by word translation. Even the examples are the same. Since the german version is longer, it seems that the english text in wikipedia is taken from there. The URL is http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/shell/shell.htm
80.145.80.78 20:36, 29 Nov 2003 (UTC) (de:Benutzer:Hubi)
Is shell sort different from comb sort?
Has anyone actually *used* shell sort at all recently? Quicksort is much faster in practice, and just as simple to implement, merge sort give you guaranteed n log n performance amd only requires sequential access, heapsort is also guaranteed n log n, in-place, with pretty much no overhead whatsoever, and there are a variety of specialised sorting algorithms - for instance, for strings, which have much lower constant factors. Anybody? --Robert Merkel 14:14 May 14, 2003 (UTC)
---
The sample claims to be in Java, and yet is in C.