Start learning →

Sequential search through a list of N words has a worst case order of growth of:

AOrder 1
BOrder 2
COrder 3
DOrder N
Answer & Solution
Correct answer: D. Order N
1. Every element may have to be checked. 2. The work grows in step with the list length. 3. So it is order N. _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