First Page | Document Content | |
---|---|---|
Date: 2011-03-20 04:03:38Sorting algorithms Order theory Mathematics Combinatorics Quicksort Shellsort Insertion sort Merge sort Adaptive sort Factorial Time complexity Heapsort | Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewAdd to Reading ListSource URL: precision.moscito.orgDownload Document from Source WebsiteFile Size: 114,28 KBShare Document on Facebook |
Asymptotic analysis of (3, 2, 1)-shell sortDocID: 18sKC - View Document | |
Algorithmica: 442–457 DOI: s00453Algorithmica ©DocID: 17YUf - View Document | |
Microsoft Word - NIK-2006-rev2.docDocID: 10Nvc - View Document | |
Analysis of Shellsort and Related Algorithms Robert Sedgewick* Princeton University This is an abstract of a survey talk on the theoretical and empirical studies that have been done over the past four decades on the ShelDocID: ZzAE - View Document | |
GlitchSort2 Reference GlitchSort2 A domesticated glitch generator by Paul HertzDocID: zYzs - View Document |