View Code? Open in Web Editor
NEW
selection, insertion, shell, quick, merge sort on c++ iterators
License: MIT License
C++ 81.13%
C 4.83%
R 14.04%
sorts's Introduction
- Test implementation of selection, insertion, shell, quick, and merge sorts on c++ iterators
- Screwing around with R to produce a plot of input size and execution time
- This is with a uniform random input of varying size
- Known improvements could be made for merge sort (removing temporary array allocation)
Debug
![Sort Execution Time: Debug](https://raw.githubusercontent.com/jmoyers/Sorts/master/Sorts/sorts.png)
Release
![Sort Execution Time: Release](https://raw.githubusercontent.com/jmoyers/Sorts/master/Sorts/sorts_release.png)
Log-log
![Sort Execution Time: Release/Log-log](https://raw.githubusercontent.com/jmoyers/Sorts/master/Sorts/loglog.png)
sorts's People
Contributors
Stargazers
Watchers