Start learning →

An algorithm with no loop at all has a time complexity of:

A9
B1
C2
D5
Answer & Solution
Correct answer: B. 1
1. The instruction count does not grow with the data. 2. It stays the same whatever the input size. 3. Such constant time algorithms have complexity 1. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._
Practise this question with Quill — Engineering — Tanzania →

Keep practising Sorting Algorithms

Browse all Sorting Algorithms questions for Engineering — Tanzania, or explore more Computer Science topics.

Start a Sorting Algorithms lesson →
Related questions
Sorting bingoType the numberSort the algorithm wordsBubble or selectionSlice the algorithm wordsRun the algorithm gatesPop the complexity classesCatch the sorting words