WorksheetsC++ Searches and Sorts
Total questions: 9
Worksheet time: 27mins
Linear search algorithm:
Scans each index until finding a matching value
Repeatedly dividing in half the array until found
Bubble sorting technique
None of them
Linear Search works when the array is?
Sorted
Unsorted
Both
None of the above
A binary search algorithm can be best described as what?
A instant lookup method
Repeatedly dividing in half the array until found
Start at the head, move through the list until found
None of the above
When is Binary Search preferred over Linear Search?
Small Database
Sorted Database
Unsorted Database
None of the above
Using binary search in this sorted array:
3 7 10 45 84 100 153 170
How many comparisons would it take to find number 170?
0 – 1
1 – 2
3 – 4
4 – 5
The maximum comparisons needed in Binary Search on array of size 16 is:
16
8
4
5
The maximum comparisons needed in Linear Search on array of size 32 is:
32
33
16
31
Insertion sort is a sorting algorithm in which the elements are transferred one at a time to the right position
True
False
What is the first change that insertion sort would make to this sequence?
“6 2 5 9”
6 9 5 2
5 9 6 2
9 5 2 6
2 6 5 9
