Academic paper: "Engineering In-place (Shared-memory) Sorting Algorithms", Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders, https://arxiv.org/abs/2009.13569
To start discussion, I think it's interesting to note how I landed on this repo and paper. I got curious about Tim Sort, and some searching on HN brought up a 2018 story, "On the Worst-Case Complexity of TimSort", https://news.ycombinator.com/item?id=17883461. In the comments, poster lorenzhs has an excellent comment (https://news.ycombinator.com/item?id=17884612) which points out IPS4o as a sorting algorithm that takes modern hardware into account.
To start discussion, I think it's interesting to note how I landed on this repo and paper. I got curious about Tim Sort, and some searching on HN brought up a 2018 story, "On the Worst-Case Complexity of TimSort", https://news.ycombinator.com/item?id=17883461. In the comments, poster lorenzhs has an excellent comment (https://news.ycombinator.com/item?id=17884612) which points out IPS4o as a sorting algorithm that takes modern hardware into account.