O[sqrt(n)] is the fastest sorting algorithm

The Sorting algorithms that operates at efficiency n log(n) is only true when n is a very large number, for n at the length of even the longest isogram in English, n log(n) algorithms are very, very slow.