3 ms·
I recall presenting a problem to my students a few years ago based on the 'Library Sort' algorithm. I still clearly remember the title of the original paper: 'I
by baruchel 2y ago
I recall presenting a problem to my students a few years ago based on the 'Library Sort' algorithm. I still clearly remember the title of the original paper: 'Insertion Sort is O(n log n)'.
- deathanatos 2y agoPresumably this: https://www3.cs.stonybrook.edu/~bender/newpub/BenderFaMo06-librarysort.pdf https://www3.cs.stonybrook.edu/~bender/newpub/BenderFaMo06-l... Kind of a click-baity title.
- foota 2y agoIt's sort of click bait, but also true, right? This is just insertion sort using non-fixed indexing?
- zeroonetwothree 2y agoThis is a different problem though, despite the similar name.