ipsofacto

7 ms·

1. 1.▲
   by ipsofacto 6y ago

   There's also an interesting video by PowerPlayChess here https://www.youtube.com/watch?v=31UzlgNtQYQ which covers the games where self capture is allowed. There are some really fascinating tricks that are now possible
2. 2.▲
   by ipsofacto 6y ago

   There's some logic to detect if the data is already sorted or reverse sorted, but I think that's only triggered at the very beginning and not at every recursion level. If the data is almost sorted it seems to become a little bit f
3. 3.▲
   by ipsofacto 6y ago

   The 274 ms is for the sequential version of the algorithm (on my i7-9750 laptop). On my office Xeon E5-2690 machine when using multiple threads the runtime decreases like this 840 ms for std::sort 372 ms for IPS4o sequentially 201 ms for 2
4. 4.▲
   by ipsofacto 6y ago

   No affiliation, just picked the name because it fit... The company I work at was exploring various sort algorithms to use and this turned out to be the fastest. Another benefit of this algorithm is that it is parallizes extremely well.
5. 5.▲
   by ipsofacto 6y ago

   There's an even better branch-free (super scalar) sorting algorithm: "In-place Parallel Super Scalar Samplesort (IPS4o)" which we started using: https://github.com/SaschaWitt/ips4o https://arx