Algorithm Analysis
Resources: What is Algorithm? Asymptotic Notation In computer science, Asymptotic Notation is a mathematical language used to describe the efficiency of an algorithm as the input size (usually called $n$) grows toward infinity. It allows us to ignore hardware-specific details (like processor speed) and focus purely on how the time or space requirements of a ... Read More