Confidently say O(n), O(log n), O(n²), Big-O, NP-hard, and heuristic — the complexity notation and CS theory terms you will need in technical interviews.
0 / 5 completed
1 / 5
How is 'O(n)' (Big-O linear) pronounced?
O(n) is pronounced /oʊ ɛn/ — 'OH EN'. The 'O' is the letter O /oʊ/, read as the word 'oh'. The 'n' is the letter name /ɛn/ — 'EN'. Together: 'OH EN'. In context, developers say 'this is O of n' or 'O-n'. The full form 'Big-O of n' (/ˈbɪɡ oʊ əv ɛn/) is also common, especially when explaining complexity. 'O(n)' denotes linear time complexity — the runtime grows proportionally with the input size. Always read the O as 'oh', never as zero or the word 'order' in isolation.
2 / 5
How is 'O(log n)' pronounced?
O(log n) is pronounced /oʊ lɒɡ ɛn/ — 'OH LOG EN'. The 'O' = /oʊ/ ('oh'). 'log' = /lɒɡ/ — the mathematical abbreviation for logarithm, always pronounced as the short word 'log', never expanded to 'logarithm' in speech. 'n' = /ɛn/ ('en'). Together: 'OH LOG EN'. In interviews: 'this runs in O-log-n time'. O(log n) denotes logarithmic time complexity, characteristic of binary search and balanced tree operations, where each step halves the problem size.
3 / 5
How is 'heuristic' pronounced?
Heuristic is pronounced /hjʊˈrɪstɪk/ — 'hyoo-RIS-tik'. The word comes from the Greek εὑρίσκω (heuriskō) meaning 'to find' or 'to discover' — the same root as 'Eureka!'. The initial 'he' produces a /hj/ glide: 'HYU'. The stressed syllable '-ris-' uses a short /ɪ/. The ending '-tic' = /tɪk/. Stress falls on the second syllable: 'hyoo-RIS-tik'. Three syllables. In computer science, a heuristic is a practical problem-solving approach that finds a good-enough solution quickly without guaranteeing optimality — used in A* search, greedy algorithms, and NP-hard problem approximations.
4 / 5
How is 'NP-hard' pronounced?
NP-hard is pronounced /ɛn piː hɑːrd/ — 'EN PEE HARD'. 'NP' is always spelled out: N = /ɛn/, P = /piː/. 'hard' is the English adjective /hɑːrd/. Together: 'EN PEE HARD'. NP stands for 'nondeterministic polynomial' time, but in conversation the letters are always spelled out, never expanded. NP-hard problems are at least as hard as the hardest problems in NP — no efficient (polynomial-time) algorithm is known for them. Classic examples include the Travelling Salesman Problem and graph colouring.
5 / 5
How is 'Big-O' pronounced?
Big-O is pronounced /bɪɡ oʊ/ — 'BIG OH'. 'Big' = /bɪɡ/ (short /ɪ/ + hard /ɡ/). 'O' = /oʊ/ — the letter O, pronounced 'oh'. Together: 'BIG OH'. The 'O' is never pronounced as 'zero' — it stands for 'Order of', not the digit 0. In full: 'Big-O notation' = 'BIG-OH noh-TAY-shun'. Big-O notation describes the upper bound of an algorithm's time or space complexity as a function of input size, used to compare algorithm efficiency in coding interviews and computer science education.