GitHub - Jonathan5122827/SortingAlgorithms: Analysis of time complexity for various sorting algorithms. Alphabetically sorts a list, that contains the names of every child care center in the United States.

Jonathan5122827 / SortingAlgorithms Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Analysis of time complexity for various sorting algorithms. Alphabetically sorts a list, that contains the names of every child care center in the United States.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Child_Care_Centers.csv		Child_Care_Centers.csv
README.txt		README.txt
main.cpp		main.cpp

Repository files navigation


Compile the program using the command, g++ main.cpp

Run the program using ./a.out

When the program is running, enter a number for the algorithm you'd like to run.

The program ends when you run an algorithm, so you must run the program five times, to test the 5 algorithms.

Open the generated file using the command, nano SortedCenters.txt

This SortedCenter.txt is overwritten for each run through of the program.

About

Analysis of time complexity for various sorting algorithms. Alphabetically sorts a list, that contains the names of every child care center in the United States.

quicksort mergesort insertion-sort big-o heapsort ctime time-complexity-analysis

Readme

Activity

0 stars

1 watching

0 forks

Report repository