Search
Wednesday, 9th of January 2019, 3:06:31 UTC
4:06:21
beach
Good morning everyone!
4:06:31
no-defun-allowed
Good morning beach!
4:07:29
beach
Things are back to normal after the holidays. Today my favorite coauthor will come over for lunch, and in the afternoon, we will likely work on some of our ELS paper submissions.
4:08:20
Gnuxie[m]
good morning beach
11:43:44
shka__
beach: do you have any benchmarking guidliness for sorting algorithms?
13:35:09
beach
Not really. I would generate random permutations and compute some statistics like average, best, worst, standard deviation.
13:35:18
beach
But I haven't given it much thought.
14:03:27
pfdietz
Some sorting algorithms do well on random permutations, but poorly on (for example) almost-ordered inputs. quicksort, for example.
14:05:49
jcowan
hence introsort, a very fine variant of quicksort with guaranteed O(n log n) behavior.
14:08:01
shka__
i want to make in-place merge sort
14:08:24
shka__
i will make in-place merge next
Wednesday, 9th of January 2019, 15:06:31 UTC