insertion sort

Which of these are NOT valid reasons why a programmer might choose a bubble sort to sort a dataset? (Choose 1-4 answers)

• More complex sorting algorithms can require a lot of memory

• The dataset might contain a small number of items

• The dataset might contain a large number of items

• 0.6 of a second to sort 10,000 items sounds reasonable

Speed of sort depends on how unordered the list is.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Which sorting algorithm needs to go through the list repeatedly?<br />

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

What type of sort is this?

• insertion sort

• merge sort

• binary sort

• bubble sort

Doesn’t use much memory.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Efficient way to check if a list is already in order.

• Bubble sort
• Insertion sort

Which type of sort algorithm is this?

• Insertion sort

• Merge sort

• Bubble sort

• None of these

Does not cope well with very large lists.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Which type of sort algorithm is this?

• Insertion
• Merge
• Bubble