Skip to content

Runs a quick sort algorithm on a number of pathological cases before analysing the results.

Notifications You must be signed in to change notification settings

benhhack/Quick-Sort-Pathological-Case-Analysis

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project

This project implements an ordinary (not in place) quicksort on a number of different pathalogical cases. It then analyses the execution times of running these algorithms to examine the performance of the quicksort on these cases.

Using the Project

Go into the src folder and run

javac *.java
java SortRunner.java

to run the sorter on the pathological cases. The data in results.csv will be overwritten when the Sort Runner is executed. From there, run the analysis (analysis.ipynb) to get the graphical output. An analysis of the results can be found in Report.pdf.

The tests can be run within sorter package and the cases.tests package. Note that the Pathological Cases methods which create arrays were not tested.

About

Runs a quick sort algorithm on a number of pathological cases before analysing the results.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published