GCSE J277 - 2.1.3 - Searching Algorithms

A binary search works by

• Only searching 0 and 1
• Spliting data in half each time when searching
• Checking every item sequentially
• Randomly searching for an item

A linear search works by

• Only searching 0 and 1
• Spliting data in half each time when searching
• Checking every item sequentially
• Randomly searching for an item

What formula is needed for a binary search

• n + 1 / 2
• (n + 1) / 2
• n / 2 + 1
• n + (1 / 2)

In this list, what is the first item checked in a binary search: 1, 3, 5, 6, 7, 8, 9

• 1
• 6
• 8
• 9

In this list, what is the first item checked in a linear search: 1, 3, 5, 6, 7, 8, 9

• 1
• 6
• 8
• 9

What's the minimum number of searchings using a linear search on: 1, 3, 5, 6, 7, 8, 9

• 1
• 2
• 3
• 7

What's the minimum number of searchings using a binary search on: 1, 3, 5, 6, 7, 8, 9

• 1
• 2
• 3
• 7

What's the maximum number of searchings using a linear search on: 1, 3, 5, 6, 7, 8, 9

• 1
• 2
• 3
• 7

What's the maximum number of searchings using a binary search on: 1, 3, 5, 6, 7, 8, 9

• 1
• 2
• 3
• 7

Which searching algorithm needs data to be in order

• Linear
• Binary