Skip to content

abozer/Insertion_vs_Merge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Implementations for Insertion Sort and Merge Sort in C++.

input.txt contains the number of elements to be read in the first line and 100000 random integer entries to be sorted. output.txt is the output of ascending sorting using both algorithms.

The program outputs the running time comparison of the two algorithms for given number of elements.

About

Comparison of Insertion Sort and Merge Sort

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages