cs1_notes - Data Stuctures Stacks (abstract data type)...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
1. n 2 2. nlgn move something in the while loop 3. n tricky j does not reset so max is 2n not n 2 4. n 2 same as 3 but j resets so n*n 5. lgn straightforward, double each time, exponential behavior 6. lgn straightforward, halving each time, exponential behavior 7. n 2 counts pairs of numbers that are out of order 8. n j loop breaks so 2n
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Data Stuctures Stacks (abstract data type) Queues (abstract data type) Binary Trees AVL Trees Heeps Hssh Tables Stacks Modify: push (place item on top), pop(remove top item) Functions: full?, empty?, top (look at top of stack)...
View Full Document

This note was uploaded on 11/09/2009 for the course COP 3223 taught by Professor Guha during the Spring '08 term at University of Central Florida.

Ask a homework question - tutors are online