What is Big and O in Big O notation? I've read the definitions and it doesn't tell what is O pronounced as 'oh'. For example – I understand that O(n) is complexity of a linear algorithm where n could be the number of operations. but what is an O?
Big O Complexity – Understanding the ‘O’ in Big O Notation
big ocomplexity
Best Answer
Well, my guess would be order, which coincides with wikipedia.
Edit: (my own (any improvements appreciated)) translation from the German wikipedia article