Worst Case
← Back to Big-O Notation
The input configuration that causes an algorithm to use the maximum amount of resources. Big-O typically describes worst-case behavior, providing guarantees about the maximum time or space an algorithm will ever require for a given input size.