COSC 350: Data Structures
Feb. 16, 2009

Analysis of Algorithms Concluded

Know table of common growths—see handout

More C/C++ Constructs (and why they don't matter in Python)

Typedef and data types
Sturctures and composite data
Pointers, memory management, dynamic memory allocation
Passing parameters with argv array of argc size

Arrays

Key points about arrays (in most implementations)

• fixed size chunk of contiguous memory
• same-type data (same size) stored consecutively
• accessed by offset or number of items to skip, i.e., address of item = address of first item + (offset * size of individual item)

Optimal for direct access of item (constant time address calculation) or for processing sequentially (i.e., index access and for-loop)
Can nest arrays (use double indexing or nested for-loops) or can have arrays of structures
In C/C++ vectors add bounds checking
Lists function as array in Python
List implementation in Python—list of addresses to objects
Examples in text: Sieve of Eratosthenes, Coin-flipping, Closest-point

Homework

This page was created by Joe Sloan.
It was last modified on or after: 18 February 2009
Send mail to: sloanjd@wofford.edu