preSortedSortAlgorithm

Content

C presort.cp I The Pre Sorted Sort algorithm can be insanely fast, sometimes. How it works: MIl Send your unsorted list to the API sorted list – sendToAPI("presortedlists.com". unsorted list) W If a similar list is found, the API returns a previously sorted version of your list made by some other user if (sorted list is not empty) return sorted list; Else, sort the list locally, upload the result to help other poor soul else sorted list bubbleSort (unsorted list); uploadToPI(presortedlists.com sorted list); return sorted list; The API contains more than one million pre sorted lists, covering most sorting cases. Don’t waste time sorting when others already sorted!