Which search algorithm is more likely to complete the search in fewer steps?

• Binary
• Linear

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

Which type of search algorithm is this?

• Binary
• Linear

If the data is in order the best search to use would be a

• Binary Search
• Linear Search

Which of these is NOT a search algorithm

• Binary
• Linear
• Bubble

'The worst case scenario is you have to check all the values' is a disadvantage for a 

• Linear Search
• Binary Search

Why does a bubble sort do a final pass even when the data is in the correct order?

• To save the data
• It does not recognise that the data is in order until the final pass requires no changes
  
• It needs to do this to put the data back in to a list
  

What does a bubble sort do?

• Sorts a list by comparing two items that are side by side, to see which is out of order
• Separates a list of data into different collections of data, before sorting and gathering back into a list
• Finds an item of data in a list

What is the biggest disadvantage of a binary search?

• It is slow
• It can only be used if the data is sorted into an order
  
• It takes the data and keeps dividing it in half until it finds the item it is looking for

What does a binary search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested
• Converts all the data into binary
• Takes the data and splits it in half repeatedly until it finds the data item requested