GitHub - ianscottcamp/Algo: Test run times of various sorting algorithms in C

ianscottcamp / Algo Public

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

Test run times of various sorting algorithms in C

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
.gitattributes		.gitattributes
.gitignore		.gitignore
BucketSort.c		BucketSort.c
CountingSort.c		CountingSort.c
HeapSort.c		HeapSort.c
InsertionSort.c		InsertionSort.c
MergeSort.c		MergeSort.c
PlotRuntime.m		PlotRuntime.m
QuickSort.c		QuickSort.c
RadixSort.c		RadixSort.c
Results.pdf		Results.pdf
SortTime		SortTime
SortTime.c		SortTime.c
a.out		a.out
compile		compile
data.txt		data.txt
project1.pdf		project1.pdf
readme.txt		readme.txt
sortscript.sh		sortscript.sh
xsort.o		xsort.o
xsort_64.o		xsort_64.o

Repository files navigation

This project tests the run time of different sorting algorithms using different sizes of data lists. Results of these run times were graphed using matlab and put into results.pdf