In the previous section, we calculated the exact polynomial execution time of a function, such as $T(n) = 3n + 4$. While mathematically precise, dealing with exact polynomials becomes impossible as software architectures grow to millions of lines of code.
To truly understand why Algorithmics is critical, we must experience failure. In this case study, we will take a deceptively simple problem and attempt to solve it.
We have established the mathematical foundations of complexity analysis and asymptotic notation. Now, we will apply these engineering principles to one of the most fundamental operations in computer science: Information Retrieval (Searching).