Post date: Feb 01, 2011 6:2:44 AM
Sorting and big O
Reuse a sorting algorithm (selection, bubble, insertion, merge, quick, etc.) and animate the algorithm's progress. Demonstrate and explain the algorithm to fellow students in an informal presentation.
The project is now documented and accompanied by head start code. You will be working in pairs to be announced in class.
In order to work better in pairs, we will dedicate more class time to the project than normal. The target date for completion of coding and testing is Saturday, Feb. 19. What is usually considered to be the final draft will likely not be a revision of the written work, but a presentation delivered in class for participation points. It will be coordinated with the Review Project presentations.
Exhibits of this project are published.