Pop Sort - FIRST POST

Question

super fast numeric sorting algorithm for large batches of large numbers.
https://code.sololearn.com/cVBRhOyGaqj9/?ref=app

Answer 1

This one is a good start. In the next step you can think of a better time complexity. At the moment your program is in O(n^2) which means that your algorithm's needed runtime growths polynomially with the length n of your input.
If I'm correct the best currently available sorting algorithms need n*log(n) steps in the worst case.