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.
[ Parent
| on HN ]