Big O notation is a way to graphically represent how fast the complexity of an algorithm grows while the number of data points it requires approaches infinity. The one with the lower BigO notation is usually better, at least performance-wise. Some algorithms such as finding all permutations of a list of values, or even calculating the factorial number of a value have very common O(n!) solutions.
Sort: