Practice Example 2: Searching Algorithms (13.6) - Implementation of Algorithms to Solve Problems

Practise this section

10 questions

Flashcard drill
3 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is Linear Search?
Show hintHide hint
Think about how you would look through a stack of papers.
Question 2.
What condition must be met to use Binary Search?
Show hintHide hint
Recall the steps of Binary Search.
3Question 3.
What is the time complexity of a Linear Search?
- O(n)
- O(log n)
- O(n²)
Show hintHide hint
Think about how it processes elements one by one.
4Question 4.
True or False: Binary Search can be used on unsorted lists.
- True
- False
Show hintHide hint
Consider the requirement for 'dividing in half'.
Question 5.
Given a list of 10,000 sorted integers, determine how many comparisons are needed to find a target using Binary Search.
Show hintHide hint
Think about how binary search divides the data.
Question 6.
Create a program to implement both Linear Search and Binary Search and compare their efficiency using large datasets.
Show hintHide hint
Use a timing function available in your programming language for the comparison.

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