Sorting in Data Structures

What is Sorting?

These sorting algorithms have O(nlogn) time complexity, except…

• Insertion Sort

• Merge Sort

• Heap Sort

These sorting algorithms have O(1) space complexity, except…

• Insertion Sort

• Heap Sort

• Merge Sort

• Bubble Sort

John von Neumann invented which sorting algorithm?

• Selection sort

• Bubble sort

• Merge sort

• Quick sort

Which piece of code deals with the swapping step in bubble sort?

• 
• 
• 

If the number of records to be sorted is small, identify the suitable sorting to be used

• Quick sort

• Merge sort

• Selection sort

• Bubble sort

How many steps are needed to sort the following numbers using a selection sort?

5 1 12 -5 16 2 12 14

• 8

• 6

• 7

• 5

Which algorithm does this image represent?

• Bubble sort

• Merge sort

• Linear search

• Binary search

Which sorting algorithm is more efficient with longer lists of data?

• Merge sort

• Bubble sort

• Both

• Neither

Why might a sorting algorithm be needed before a search?

• Data is better when ordered

• Data always needs to be in order before searching

• The search algorithm may be in the code before the sorting algorithm

• The search algorithm may need the data to be in order