| Fun-Sort (2007) | |||||||||||||||
Abstract | |||||||||||||||
| In this paper we study greedy in-place sorting algorithms which miraculously happen to work in reasonable time. Dumb-Sort which repeatedly compares all possible pairs of array cells sorts n elements in n \Gamma 1 cycles, or time O(n 3). Not-So-Dumb-Sort, which only tests adjacent cells, also sorts in n \Gamma 1 cycles, or in time O(n 2 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||