Last edited 10dec2013 by petrisk2@illinois.edu

Find this document at http://new.math.uiuc.edu/math198/petrisk2
# Visualizing Data Structures

## By Dan Petrisko

## Abstract

** To say algorithms are a major component of computer science is a gross understatement. Even as computers become more and more powerful, data sets expand faster still, dictating the need for the most efficient processing possible. The goal of my project is to illustrate the major properties of several algorithms for comparison data sets of varying size and complexity. Because of their relative simplicity and ease of illustration, I will focus on rudimentary sorting, searching and selecting.
**
Julia Set Proof of Concept

Presentation on Algorithms

Narrative

Documentation

Sorting Demonstration Click here to run

Searching Demonstration Click here to run

### References

http://www.cs.auckland.ac.nz/~jmor159/PLDS210/niemann/s_man.htm

http://mathworld.wolfram.com/RecurrenceEquation.html

http://en.wikipedia.org/wiki/Sorting_algorithm

http://en.wikipedia.org/wiki/Graph_theory