Searches and Sorts

Bubble sort uses a divide-and-conquer approach.

• True

• False

Which sort is the slowest and most inefficient of all?

• Bubble sort

• Merge sort

• Selection sort

• Insertion sort

The divide-and-conquer approach is the fastest approach in most cases

• True

• False

In an insertion sort, what would the list look like after the third pass?

• 1 2 5 4 3

• 1 2 3 4 5

• 1 2 4 5 3

• 2 5 1 4 3

Which of the following best describes merge sort?

• The original list is divided into four parts and reduced.

• The original list is split in half and then sorted and combined.

• The original list is broken up into sublists repeatedly until each sublist contains one element and then combined

• If the number of elements is even, the list is divided into two parts and sorted but if it is odd, the list is divided into three parts and then sorted.

What does a searching algorithm do?

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

What would be needed if searching algorithms didn't exist?

• The data would need to be saved
• Each item of data would need to be looked at one by one, until the searched for data was found
• A new set of data to look at would be needed

Which of these is a type of searching algorithm?

• Linear search
• Word search
• Search engine
  

What does a linear search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested
• Organises the data into alphabetical order
• Splits the data until the requested data is found

What is an advantage of a linear search?

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