AQA GCSE Computer Science - 3.1.3 Binary Search

Which one of the algorithms is the best search algorithm?

• Binary Search
• Bubble Sort
• Denary Search
• Linear Sort

Which searching algorithm is more effective when the list is sorted?

• Binary Search
• Linear Search
• Denary Search
• Binary Sort

How does Binary Search work?

• Halves data, repeats
• Swaps data parts.
• One by One check
• Splits into doubles

Which of the options are the most efficient with a large list?

• Binary Search
• Denary Search
• Merge search
• Linear Search

What is a disadvantage of Binary search?

• List has to be sorted
• Ony lists less than 100
• Too slow
• List must be even

What sorting method would be fastest for the average list?

• Binary Search
• Linear Search
• Denary Search
• They're all the same

Which conditions favour Binary Search?

• Sorted List
• Unsorted List
• Long List
• C and D

1,31,56,58, 64,66,70. To find 31, what is the first set of numbers left after binary search?

• 1,31,56
• 31,56,58
• 58,64,66
• 64,66,70

A database has more than 1200 numbered records. What search algorithm is used?

• Binary Search
• Denary Search
• Merge Sort
• Bubble Sort

Generally speaking, which is the most efficient searching algorithm?

• Binary Search
• Linear Search
• Denary Search
• Bubble Search