Introduction To Algorithms

From codeuu,source code

Contents 1 Basic Algorithms 2 Recursive Algorithms 3 Data Structures 4 Divide and Conquer 5 Dynamic Programming 6 Greedy Algorithms

[edit] Basic Algorithms

• Non-recursive program to compute Fibonacci numbers
• Recursive program to compute Fibonacci numbers
• Quick-find solution to connectivity problem
• Quick-union solution to connectivity problem
• Weighted version of quick union
• Path compression by halving

[edit] Recursive Algorithms

• Factorial function (recursive implementation)
• A questionable recursive program
• Euclid's algorithm
• Recursive program to evaluate prefix expressions
• Examples of recursive functions for linked lists

[edit] Data Structures

• Hash tables source code
• Binary Search Tree
• Insertion in a binary search tree
• Red Black Trees
• Insertion in Red Black Trees

[edit] Divide and Conquer

• Divide-and-conquer to find the maximum
• Solution to the towers of Hanoi
• Divide and conquer to draw a ruler
• Nonrecursive program to draw a ruler

[edit] Dynamic Programming

• Assembly-line scheduling
• Matrix chain multiplication
• Longgest common subsequence
• Optimal binary search trees
• Fibonacci numbers (recursive implementation)
• Fibonacci numbers (dynamic programming)
• Knapsack problem (recursive implementation)
• Knapsack problem (dynamic programming)

[edit] Greedy Algorithms

• Huffman source code

Algorithms Categories
Data Structure Combinatorial algorithms Compression algorithms Introduction To Algorithms Computer graphics Cryptographic algorithms Classification algorithms	Digital signal processing Software engineering Medical algorithms Neural networks Genetic algorithms Numerical algebra Checksum algorithms	Number theoretic algorithms Numerical algorithms Computational geometry Optimization algorithms Parsing Theory of computation and automata Data clustering algorithms