How should I pronounce the following things? (These are complexities of algorithms.)
English Language & Usage Stack Exchange is a question and answer site for linguists, etymologists, and serious English language enthusiasts. It only takes a minute to sign up.Sign up to join this community
In the talks I've seen that involve algorithm complexity, I've heard it most often pronounced "oh of n", "oh of n log n", etc.
Mathematicians and CS theorists also use a lowercase o and a capital ϴ for similar measurements with slightly different implications. In this case O( n ) would be pronounced "big oh of n", o( n ) "little oh of n", and ϴ(n) "theta of n".
That is commonly referred to as Big O Notation, and since my days as a math/CS student I have always pronounced it (and heard it pronounced) as "Big O of n", "Big O of n log n", etc.