Start learning →

The notation used to describe worst case order of growth is:

ABig P notation
BBig T notation
CBig O notation
DBig M notation
Answer & Solution
Correct answer: C. Big O notation
1. Computer scientists needed a formal way to compare algorithms. 2. One asymptotic notation became standard. 3. It is Big O notation. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions
Algorithms bingoType the numberSort the computing ideasArray or linkedSlice the structuresRun the algorithm gatesPop the growth classesCatch the data structures