Closed whyi closed 9 years ago
I know the original algorithm is based off of Bucket sort. But realize that # of corners are bounded anyway (i.e static data came from a mesh file) Then why can't it be radix-sorted anyway?
Not gonna do. But I indeed switched the naive merge sort to the real quicksort.
I know the original algorithm is based off of Bucket sort. But realize that # of corners are bounded anyway (i.e static data came from a mesh file) Then why can't it be radix-sorted anyway?