We need to test the efficacy of starting with Merge/Timsort (on the longs) instead of quicksort--specifically for the purpose of sorting partially-ordered arrays. This is based on the observation that, even if HuskyCode doesn't have sufficient resolution to separate all strings, it will not actually introduce any inversions.
We need to test the efficacy of starting with Merge/Timsort (on the longs) instead of quicksort--specifically for the purpose of sorting partially-ordered arrays. This is based on the observation that, even if HuskyCode doesn't have sufficient resolution to separate all strings, it will not actually introduce any inversions.