-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add #3
Comments
Selection sort , like insertion sort but reversed. insertion sort finds the correct location in the sorted list to insert the next element from the unsorted list or a selection sort finds the largest element from the unsorted list and inserts it into the end of the sorted list |
Categorize into the N squared class and the n log n class, then sort within those classes for practical performance and provide benchmarks from tests (average of 50 runs) on a standard 1000 or 10,000 item list Also deal with space complexity categorizing into the N, N log n and 1 class and sort within those classes if possible |
Tree sort |
Crit-bit trees - Best of both worlds: hash and heap. Insertion, deletion, and exact search. Plus find minimum and general suffix search. One example ref: https://cr.yp.to/critbit.html |
Bubble sort
Heap sort
Table listing best, average and worst case complexity for everything
The text was updated successfully, but these errors were encountered: