Data_Structures_and_Algorithm_Analysis_in_C

Implementation of ADT and algorithms in <Data Structures and Algorithm Analysis in C (Second Edition)>

Index

• algorithm analysis
  • binary search tree
  • max common divisor
  • max subsequence
  • rapid pow
• list stack and queue
  • linked list
  • queue
  • stack
• tree
  • binary tree
  • binary search tree
  • avl tree
  • splay tree
• hashing
  • open addressing
  • separate chaining
• priority queue
  • binary heap
  • binomial_queue
  • leftist heap
• sorting
  • insertion sort
  • shell sort
  • heap sort
  • merge sort
  • quick sort
• disjoint ADT
• graph theory
  • graph
  • topology sort
  • shortest path problem
  • max flow
  • depth first search
  • minimum spanning tree
• algorithm design techniques
  • greedy algorithm
  • divide and conquer
  • randomized algorithm
  • dynamic programming
• amortized analysis
  • lazy binomial queue
• advanced data structures and implementation
  • deterministic skip list(DSL)
  • top-down splay tree
  • red black tree
  • AA tree
  • treap
  • k-d tree
  • pairing heap