Contents

• Arrays: Abstract Data Type (ADT)
  • Arrays
  
  
• Lists: ADT
  • Array Lists: list
  • Pointer Lists: Introduction
  
  
• Stacks: ADT
  • Array Stacks: stack
  • Stacks: C++
  
  
• Queues: ADT
  • Array Queues: queue.dat
  • Pointer Queues: queue1
  • Queues: C++ queue2
  
  
• Recursion
  • Factorial: fact
  
  
• Trees: ADT
  • Tree Traversals: tree
  • Binary Trees: ADT
  • Binary Search Trees: ADT
  • B-Trees: Indexing to Relational DB
  
  
• Hash Tables: ADT
  • Open (Pointer) Hashing: ohash
  • Closed (Array) Hashing
  
  
• Heap/Priority Queue: ADT
  • Array Heaps: Percolate Up
  • Pointer Heaps: Introduction
  
  
• Sorting
  • Insertion Sort: Introduction
  • Selection Sort: Introduction
  • Bubble Sort: Introduction
  • Mergesort: Introduction
  • Quicksort: Introduction
  • Heapsort: Introduction
  
  
• Graphs: Introduction
  • Depth-First Search: Introduction
  • Breadth-First Search: Introduction
  • Shortest Path: Introduction
  • Minimum Spanning Tree: Intro
  • Transitive Closure: Introduction
  
  
• NP-Completeness
  • Hamilton Cycle
  • Longest Path: Introduction
  
  
• Greedy Algorithms
  • Huffman Coding: Introduction
  
  
• About this document ...