Big O is conceptual. It expresses how quickly an algorithm's runtime grows relative to the input. Big O represents the worst-case, always. Even if you think what you're looking for is the very first thing in the set, Big O doesn't care ,a loop-based ...
ashoksubbiah.in1 min readNo responses yet.