by cs105
See inside
Notes and Credits

Compares two sorting algorithms. Set n to the number of items to sort. Click on deck to create a random list. Click on brown hat to sort via selection sort (O(n^2)). Click on white hat to sort via binary search sort (O(n log n)).

Shared: 2 Nov 2008 Modified: 2 Nov 2008
Favorite this project 2
Love this project 0
Total views 243
View the remix tree  4
More projects by cs105