Recently one of our researchers were shuffling through The Alien Papers (a group of concealed papers from government officials about aliens). We found a huge revelation in it. Reports of a sorting algorithm unlike anything we've ever seen before was logged from aliens.

Impress Us With Statistics!

The algorithm was capable of O(n) average and best-case performance complexity with O(n*log(n)) worse-case performance complexity (though this is rarely likely). In regards to memory usage, it holds O(n) average, best-case, and worst-case space complexity.

The best sorting algorithm (before the discovery of this) was Quick Sort, it worked by selecting pivots and grouping other points by comparing it to the pivot's value (see for yourself at https://sorting-algorithm-jet.vercel.app/, select Quick Sort from the top). This old sorting algorithm is capable of O(log(n)) sorting speeds. The new sorting algorithm (which we will call Smith Sort), is able to work so fast by predicting values to sort ahead of time and saving results for future use. It knows exactly which values to pivot and which to group without even needing to take a second look at the array. Some of the criticisms we've found among our team is that the sorting algorithm must cache at most a kilobyte of information before every sort.

What Does This Mean

Sorting algorithms control the digital space, digital databases would be as cheap as a penny. Looking up information on Google may only take a snap of the finger. Accessing this website may no longer take 2 seconds (if it doesn't take 2 seconds, than that means we've implemented the sorting algorithm into our on-site database).