[FrontPage] [TitleIndex] [WordIndex] 

Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.

A data structure is a method for organizing collections of elements based on fundamental abstractions like records (structs in C), pointers, and arrays) to support efficient operations on those collections. Typical operations are inserting and deleting elements, finding an element given its key, or finding the maximum element in the collection. Algorithms that use data structures tend to be iterative, reducing a problem to a sequence of data structure operations.

Examples:

CategoryAlgorithmNotes

2014-06-17 11:58