premise: When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.
hypothesis: When implemented well, it can be about twelve or three times faster than its main competitors, merge sort and heapsort.