|
Algorithms
|
|
|
|
|
|
|
|
|
BSF : Breadth First Search
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.
created by syam1224 on 2008-04-23 21:30:20
|
|
|
Boyer Moore Algorithm : Pattern Matching
The Boyer-Moore algorithm is considered as the most efficient string-matching algorithm in usual applications.The algorithm scans the characters of the pattern from right to left beginning with the rightmost one. In case of a mismatch (or a complete match of the whole pattern) it uses two precomputed functions to shift the window to the right. These two shift functions are called the good-suffix shift (also called matching shift and the bad-character shift (also called the occurrence shift).
created by syam1224 on 2008-04-21 16:43:07
|
|
|
Post-order Tree Traversal Algorithm
To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node, starting with the root node:
1. Traverse the left subtree.
2. Traverse the right subtree.
3. Visit the node.
created by syam1224 on 2008-05-11 05:10:40
|
|
|
|
|
|
Submit Link Here
