Tests 4 different methods of sorting (selection, bubble, insertion, quick) and finds the most efficient one in 4 different categories. Compares how many loops, shifts, and checks each sort performs in addition to how fast their processing time is and outputs the most efficient in each category. Allows the user to choose how many numbers they would like randomly generated. Also asks the user if they would like it to be sorted in ascending or descending order.
-
Notifications
You must be signed in to change notification settings - Fork 0
ksingh0/Sorting-Efficiency
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Tests 4 different methods of sorting and finds the most efficient one in 4 different categories.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published