News for hackers. Stuff that matters.
Re:Timsort is a sorting algorithm that is efficient for real... by cntlzw on Monday July 02, 2018 @04:16AM (#17440053)
I am experimenting with Lidar datasets lately. In lidar you work with huge point clouds. Millions to billions. For some algorithms - convex hull - you need to sort the points for example by x-cooridinate. I did some quick tests with quick sort, merge sort, and timsort. In my experiments quick sort was the slowest with 5.5 seconds on the chosen dataset. Mergesort was 5 seconds and timsort was around 4 seconds.
Re:Timsort is a sorting algorithm that is efficient for real... by beagle3 on Monday July 02, 2018 @07:25AM (#17440763)
When sorting coordinates, radix sort with an appropriately chose radix (often but not always 256) is usually fastest.
Re:Timsort is a sorting algorithm that is efficient for real... by cntlzw on Tuesday July 03, 2018 @02:55AM (#17448090)
Hi there, thanks. Need to try this