|
In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list, called order statistics. This includes the cases of finding the minimum, maximum, and median elements. There are worst-case linear time selection algorithms. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems.
http://en.wikipedia.org/wiki/Selection_algorithm
created by algorithms on 2008-06-23 03:01:36
|
|
Square roots by Divide-and-Average
This method dating back to the Babylonians (1700 B.C.) is known as the Babylonian Algorithm.
If A > 0 is a guess of the square root of the positive number Q, then a better approximation to √Q is given by
B = (A + Q/A)/2.
http://www.mathpath.org/Algor/squareroot/algor.squ
created by algorithms on 2008-06-19 02:54:46
|
)
|
Given a rooted tree T and two nodes u and v, find the furthest node from the root that is an ancestor for both u and v.
http://www.topcoder.com/tc?module=Static&d1=tutori
created by algorithms on 2008-06-14 11:06:54
|
|
Threaded Binary Tree
http://linkmingle.com/details/628
created by algorithms on 2008-05-13 19:31:55
|
|
right in threaded binary search tree by Manoj Kumar Gumber
http://www.planet-source-code.com/URLSEO/vb/script
created by algorithms on 2008-05-13 05:49:29
|
|
this program creates a right-in-threaded binary tree and
performs inorder taversal on it.
http://www.sourcecodesworld.com/source/show.asp?Sc
created by algorithms on 2008-05-13 05:54:16
|
|
A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node, and all left child pointers that would normally be null point to the inorder predecessor of the node."
http://en.wikipedia.org/wiki/Threaded_binary_tree
created by algorithms on 2008-05-13 05:55:01
|
|
Trees are among the oldest and most heavily used data structures in computer programming. At the most general, trees are simply undirected graphs called free trees. However, the most common type of tree is a binary search tree, because it allows for efficient sorting and searching of data, which are the two most heavily performed operations in software.
http://www.eternallyconfuzzled.com/tuts/datastruct
created by algorithms on 2008-05-13 05:38:17
|
|
Topics
* Scheduling
* Multicommodity Flow
* Minimum Cut
* Network and Graph Algorithms
* Biology and Related Papers
* PhD and MS Theses
http://www.cs.dartmouth.edu/~cliff/papers/#net
created by algorithms on 2008-05-11 10:54:50
|
|
These lecture notes contain the reference material on graph algorithms for the course: Algorithms and Data Structures (415.220FT) and are based on Dr Michael Dinneen's lecture notes of the course 415.220SC given in 1999. Topics include computer representations (adjacency matrices and lists), graph searching (BFS and DFS), and basic graph algorithms such as computing the shortest distances between vertices and finding the (strongly) connected components.
http://www.cs.auckland.ac.nz/~ute/220ft/graphalg/g
created by algorithms on 2008-05-11 06:22:14
|
IndiaDiscuss.com : Social Bookmarkings and News Networking Site for India
RSS
Save Link 
Create/Add to List
