Assignment 29 - Sorting Benchmark

Example Output

Learning Outcomes

1. Sorting Algorithm
2. Optimization
3. Data Visualization

Goals

Understand the performance of sorting algorithms by implementing and benchmarking them.

Description

Tasks

We will be sorting arrays of integers

1. Implement two quadratic sorting algorithms.
2. Implement two efficient sorting algorithms.
3. Benchmark the four algorithms against the standard sorting algorithm provided in the standard library, at small scale and at medium scale.

Extensions

Help

For C++

Bridges documentation BFSBenchmark documentation

For Java

Bridges documentation BFSBenchmark documentation

For Python

Bridges documentation SortingBenchmark documentation