3 ms·Worst-case big-O runtime is therefore O(n^2), and best case is O(n log(n)) :)by matchu 13y agoWorst-case big-O runtime is therefore O(n^2), and best case is O(n log(n)) :)