I felt like recreating some well-known algorithms in Python and playing around with them. Given a list of 700 random numbers, you’ll see how fast these algorithms performed. Proof again that they are O(n^2) for Selection and Insertion, and O(nlogn) for Merge & Quick sort.
