Skip to content
Deep Thought

Sorting Algorithms

BigONotation.jpg BigONotationGraph.png

  • Exercise:
    • Compare different Sorting Algorithms (BubbleSort, InsertionSort, SelectionSort, MergeSort, QuickSort)
    • Write a program that tests each of the algorithms and measure the time until completion and the memory needed for different problem sizes (N=100, N=1.000, N=10.000, N=100.000, N=1.000.000)
    • Plot your findings in a graph (e.g. using Excel)
    • Compare your findings to the claimed complexities of the algorithm in the pictures above.
      • Does your result match the expected growth of time needed to complete the operations?