Section 9.4 Quicksort Algorithm Practice
Subsection 9.4.1 Goals
Understand the performance of the Lomuto Quicksort Algorithm compared to the past sorting algorithms implemented this semester. Based on your completion of this assignment, you may receive up to 10% extra credit on your previous test.
Subsection 9.4.2 Tasks
We will be sorting arrays of integers using the Lomuto Quicksort Algorithm. To do this, you will be using the same benchmarking code from your past lab.
- Implement the Lomuto Quicksort algorithm in pseudocode. (1 point)
- Implement the Lomuto Quicksort algorithm in your past benchmarking Java project (2 points)
- Document how the algorithm works in your code using comments. (1 point)
- Benchmark the algorithm against the other algorithms implemented in the past lab and show the visualization link. (1 point)
This assignment uses BRIDGES to visualize the runtime of sorting algorithms based on the size of input array. You will need your BRIDGES account with the api key to visualize the assignment.
You have attempted of activities on this page.
