Practice Worst-case Scenario (10.1.2) - Searching in an array - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the time complexity of linear search?
Show hintHide hint
Think about how many elements you might have to check.
Question 2.
Can binary search be applied to unsorted arrays?
Show hintHide hint
Recall the precondition for binary search.
3Question 3.
What is the time complexity of a linear search algorithm?
- O(1)
- O(n)
- O(log n)
Show hintHide hint
Think about worst-case scenarios in the search process.
4Question 4.
True or False: Binary search can be performed on an unsorted array.
- True
- False
Show hintHide hint
Review the requirements for employing binary search.
Question 5.
Consider an array of size n. You implement linear search, and then you change the array to be sorted. How would you expect the average search time to change, and why?
Show hintHide hint
Compare efficiency based on array structure.
Question 6.
If the input size doubles, how does that impact the time complexity for linear versus binary search?
Show hintHide hint
Chart how inputs affect search times differently.

5 more questions in this section. Enroll free to practise them all.