-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Welcome to the Sorting-Algorithms wiki!
There are a variety of sorting algorithms used in computer science. The Sorting-Algorithm project analyzes the computational time of the most popular sorting algorithms. The goal of this project is to determine which sorting algorithm can sort a randomized array the quickest.
This project generates a randomized array of integers which each sorting algorithm will sort from lowest to highest. A copy of the randomized array will be made and sorted with a built-in sorting algorithm. This copy array will then be used to check the accuracy of each array that the implemented sorting algorithms have sorted. Each algorithm is timed as it sorts the array. The results are recorded in a CSV file.
See README.md file for instruction on running the Sorting-Algorithms project
The length of time each implemented sorting algorithm takes to execute will be recorded in a CSV file along with the respective algorithm name and length of the array that was sorted. If the array was sorted too quickly to be measured a "0" will be recorded or if the algorithm takes longer than 10 minutes "inf" will be recorded. Otherwise, the sorting time in seconds will be recorded.