set useQuickSort to (resultListObject's _list_'s length > _quicksortThreshold) and (disorderedCount / (resultListObject's _list_'s length)) > 0.01 -- if list is small or already 99% in-order then insertion sort is faster than quicksort