#PERMUTATION ALGORITHM CODE#

^ Google Code Jam 2011, Qualification Rounds, Problem D.^ Naish, Lee (1986), 'Negation and quantifiers in NU-Prolog', Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 225, Springer-Verlag, pp. 624–634, doi: 10.1007/2-8_111.Sabry, Amr (2005), 'Backtracking, interleaving, and terminating monad transformers: (functional pearl)', Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming (ICFP '05) (PDF), SIGPLAN Notices, pp. 192–203, doi: 10.1145/1086365.1086390, S2CID 1435535, archived from the original (PDF) on 26 March 2012, retrieved 22 June 2011 ^ a b Kiselyov, Oleg Shan, Chung-chieh Friedman, Daniel P.Ruepp, O., 'Sorting the slow way: an analysis of perversely awful randomized sorting algorithms', 4th International Conference on Fun with Algorithms, Castiglioncello, Italy, 2007 (PDF), Lecture Notes in Computer Science, vol. 4475, Springer-Verlag, pp. 183–197, doi: 10.1007/978-4-3_17. However, the best case is O( n), which happens on a sorted list.

Particular care must be taken in the implementation of this algorithm as optimizing compilers may simply transform it into a while(true) loop. Because the order is never altered, the algorithm has a hypothetical time complexity of O( ∞), but it can still sort through events such as miracles or single-event upsets. It continually checks the array until it is sorted, never changing the order of the array. Miracle sort A sorting algorithm that checks if the array is sorted until a miracle occurs. Assuming that the many-worlds interpretation holds, the use of this algorithm will result in at least one surviving universe where the input was successfully sorted in O( n) time. The algorithm generates a random permutation of its input using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Quantum bogosort A hypothetical sorting algorithm based on bogosort, created as an in-joke among computer scientists. Permutation of the Last Layer (PLL) solves the cube after the top face is completed. To organize your progress and train the algorithms, use the 2-look OLL algorithm trainer.

Slowsort A different humorous sorting algorithm that employs a misguided divide-and-conquer strategy to achieve massive complexity. Other algorithms can be memorized by patterns (which is a common technique for memorizing algorithms) shown in the video. This algorithm can be made as inefficient as one wishes by picking a fast enough growing function f.

Unbounded (randomized version), O ( n × n ! ) = factorial of n iterated m times.

Permutation algorithm