What does 'Big O notation' measure in algorithm analysis?
-
A
The size of the codebase in bytes
-
B
The upper bound of an algorithm's time or space complexity relative to input size
-
C
The number of bugs in a given function
-
D
The memory allocated to the operating system