Java Search and Sort

What does a searching algorithm do?

• Search through a set of data
• Save a set of data
• Help to organise data

Which of these is a type of searching algorithm?

• Linear search
• Word search
• Search engine
  

What is an advantage of a linear search?

• It is very quick
• It only works with ordered lists
• It is a simple algorithm

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

Which search algorithm would be best to use with ordered data?

• A binary search
• Either binary search or a linear search
• A linear search

What is an advantage of a binary search

• It's very quick
• It only works with ordered lists
  
• It is a simple algorithm

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 an insertion sort do?

• Separates a list of data into different collections of data which are sorted and gathered back into a list
• Goes through a list of data a number of times and compares two items that are side by side to each other to see which is out of order
• Goes through a list, comparing two items that are side by side, and continues to move one value until it is in the correct place.

Which of the following is an advantage of a insertion sort when compared with a bubble sort?

• It is quicker than a bubble sort algorithm
  
• It is simpler than a bubble sort algorithm
• There is no advantage.

How many passes will an insertion sort go through?

• Only one pass
• Two passes
• Several passes - until the data is fully ordered