Computational Complexity vs Data Structure Display

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! https://github.com/keithgardner2/complexity Yay computational complexity! Yay Hartmanis and Stearns!

A novel data structure learning app, the most significant feature is that you can dynamically debug the data structure in this app, and visually observe the changes in the data structure during the operation. In this app you can learn the following data structures: 1. Linear structures, including arrays, linked lists, queues, stacks. Linear structures are the basis for other advanced data structures, as fine as advanced algorithms. 2. Tree structures, including binary tree, binary search tree, AVL tree, red-black tree, and heap. In this app, you can dynamically debug three traversals of the binary tree (including non-recursive traversal implementations), searching in the tree, balance adjustments in the AVL tree and red-black tree, and heap sorting. Give you the ability of handwritten red-black trees. 3. Graph structure, including the adjacency list storage representation of the graph structure, depth-first search and breadth-first search, finding the Euler path in the graph, topological sorting, maximum connected components, minimum spanning tree problem, and shortest single source Path problem. It also provides dynamic debugging of these classic graph algorithms. 4. The data structure introductory class will talk about the problem of the Tower of Hanoi. The algorithm that solves this problem is often recursive. This app provides dynamic debugging of the Tower of Hanoi problem, so you can no longer be confused about the recursive calls of the Tower of Hanoi.