Flashback with me to my CompSci days (and realize how much I’ve forgotten, and how easy it is to remember) with this inefficient sort algorithms analysis. Check out the O(n! ^ 2) code at the end!