Skip to content
/ Sort-Algorithms-Compare Public

This project compares sort algorithms execution time in nanoseconds time based in a N sized array.

4 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

MatMercer/Sort-Algorithms-Compare

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits

.idea

.idea

 
 

src

src

 
 

.gitignore

.gitignore

 
 

CMakeLists.txt

CMakeLists.txt

 
 

README.md

README.md

 
 

sort_plot.py

sort_plot.py

 
 

Repository files navigation

Sort Algorithms Comparison

Note: Click on the images for a interactive version of the plots

For what this project is used for?

This project tests sort algorithms execution time by nanoseconds based in an N size array that increments from 1 to a max size specified by command line arguments.

The sortalgs executable generates .csv files based in the algorithms:

sortalgs executable

And the sort_plot.py generates the plots at plotly:

Generate the plots

The currently generated graphs:

About

This project compares sort algorithms execution time in nanoseconds time based in a N sized array.

Resources

Readme
Activity

Stars

4 stars

Watchers

2 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages