This app demonstrates the basic principles of computational complexity. The growth of a few typical Big-O functions are illustrated with an interactive graph, and live demonstrations of sorting algorithms can be run using randomly generated data.
This app was developed at SUNY Binghamton, by Prof. Patrick H. Madden. Version 1.1 is an expansion on this, with the assistance a few students (primarily Keith Gardner, and undergrad, and Anthony Canino, an MS grad). We're working on the app as a fun project, and as a way to introduce ACM student group members to iOS programming.
The source for the app is available on Github; we'll be adding more algorithms and things, and if you're interested in helping out with the development, let us know!
Yay computational complexity! Yay Hartmanis and Stearns!
Added support for the iPhone and iOS 6.
More sorting algorithms have been added in, as well as methods to alter the sorting data to be ascending, descending, or with all values equal.
Ratings and Reviews
Hands on for time differences
Helps really show "the big deal" about which algorithm you use and recurrence count
With Family Sharing set up, up to six family members can use this app.