Home CPSC 220

Sort Comparison

Objective

To compare the performance of the bubble sort and merge sort algorithms.

Task

For this lab, you will write some code to test the actual runtime of bubble sort and merge sort for large input sizes. You should create randomly filled arrays of various sizes, sort them with each method, and calculate the time taken with each method.


Details


Submitting

When your program works, email the code to ifinlay@umw.edu. In the body of the email, paste the output of your program, which should show the performance difference between the two sorts.

Copyright © 2018 Ian Finlayson | Licensed under a Creative Commons Attribution 4.0 International License.