1) What is the purpose of a search algorithm? a) To decorate data b) To make the data colorful c) To find a specific item in data d) To delete all data 2) Which search algorithm is faster for sorted data? a) Linear search b) Bubble sort c) Binary search d) Insertion sort 3) What is required before using binary search? a) Random order b) Sorted list c) A special calculator d) A search app 4) Which search algorithm checks each item one by one? a) Binary search b) Linear search c) Quick sort d) Hashing 5) In a linear search, where does the search start? a) In the middle b) At the end c) Random place d) At the beginning 6) If a list has 1000 items, which search is likely faster? a) Linear search b) Binary search c) Manual search d) None 7) What happens in each step of a binary search? a) The whole list is checked b) Half the list is removed c) Items are sorted d) All numbers are added 8) What kind of data works best for linear search? a) Sorted b) Unsorted c) Color-coded d) Labeled

LP 3 Linear vs. Binary Search

Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?