Factorial Complexity

Michael highlights the staggering growth of factorial calculations, especially when dealing with permutations of large arrays. He shares a mind-boggling example where calculating permutations for an array of size 1000 results in a computation time represented by over 2500 digits. Joe paints a vivid picture of the factorial growth curve, emphasizing its explosive nature in Big O notation.