# Binary searching and sorting

## Quiz by Maitha Rashed

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measure skillsfrom any curriculum

Measure skills

from any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

With a free account, teachers can

- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on students’ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet

9 questions

Show answers

- Q1A binary search algorithm works on the principle of _____?divide and conquerconvert to binary and searchdivide and convert to binarysequential search30s
- Q2Which of the following conditions must be true in order to search for a value using binary search? I. The values in the array must be integers. II. The values in the array must be in sorted order. III. The array must not contain duplicate values.I and IIII and IIIII onlyI only.30s
- Q3Which will cause the shortest execution of a binary search looking for a value in an array of integers?The value isn't in the arrayThe value is in the middle of the arrayThe value is the last one in the arrayThe value is the first one in the array30s
- Q4Under what condition will an insertion sort execute faster?It will always take the same amount of time to executeIf the data is already sorted in ascending orderIf the data is already sorted in descending order30s
- Q5Under what condition will a selection sort execute faster?It will always take the same amount of time to executeIf the data is already sorted in descending order.If the data is already sorted in ascending order.30s
- Q6Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the recursive binary search algorithm. Which group of numbers correctly shows the sequence of comparisons used to find the key 8.18, 12, 6, 812, 6, 11, 811, 5, 6, 83, 5, 6, 830s
- Q7How many comparisons would it take to find the value 2 in the following list using a binary search? {1, 3, 7, 8, 5, 2, 9}Not possible03230s
- Q8How many binary searches will it take to find the value 6 in the list [1,3,6,8,10,12]?213030s
- Q9How out of 10 will you rate our presentation and quiz?109.89.79.930s