Community
Participate
Working Groups
TwoArraySorter uses quicksort even on small arrays, which results in many, many redundant recursive calls. It should stop at level, say, 7 and sort small sections by inserion sort. I think this should reduce the 4.5 second delay I see when using OpenType
Quicksort results in log N recursive calls. So even if we stop at size 8, we'll only save 3 recursive calls.
for a list of 16'000 elements (to approximate the number of types in bigworkspace) there are 2'000 fragments of length 8. that means 6'000 recursive calls more.
