Here's the question you clicked on:
agdgdgdgwngo
What is the fastest way to sort a million unsigned 32-bit integers? @Mathematics
I think it can be radix sort with complexity \(O(k * n)\) where n is the number of numbers that have no more than k digits.
If they're in random order, quicksort. If they're partially/mostly sorted, mergesort or heapsort.
You know there is a video on Youtube where Eric Schmidt asks this question to Barack Obama.