Answer available
Class 12 · Computer Science · Complexity and Big O Notation
Why are constants and lower-order terms dropped from a big O expression?
3 marksMediumShort answer
ICSE question bank
Every question in the vault, filterable by class, subject, chapter, topic, year, marks, difficulty, type and source. The filters live in the URL, so any view you build can be shared.
4 questions
- Answer available
Class 12 · Computer Science · Complexity and Big O Notation
State the time complexity of the following and justify it: for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) sum++;
3 marksMediumNumerical
- Answer available
Class 12 · Computer Science · Complexity and Big O Notation
What does big O notation measure, and give the complexity of linear search, binary search and bubble sort.
3 marksMediumShort answer
- Answer available
Class 12 · Computer Science · Complexity and Big O Notation
Give the time complexity of merge sort, insertion sort in the worst case, and accessing an element of an array by its index.
3 marksMediumNumerical