The Open Source Swiss Army Knife
|
|||||
| | |||||
| sub-categories and articles | ||
| --->create new sub-category | ||
 backtracking.txt | ||
| add
backtracking ============ (source: computer algorithms c++, horowitz & sahni ... ) The desired solution is returned in the form of an *n-tuple* (x1 .... xn). A *tuple* is a set of results. Here, every Xi in the returned tuple is a subset of *S*. Often these problems require finding one vector which maximizes or minimizes the *criterion function*. As an example of a its operation, when sorting an array, the tuple returned is of size *n* and the *criterion function* is that a[x^i] < a[x^i + 1] for 1 <= i <= n. | ||
| brute_force.txt | ||
add
BRUTE FORCE APPROACH | ||
| decrease_and_conquer.txt | ||
decrease and conquer algorithms and analyses:
DECREASE AND CONQUER | ||
| divide_and_conquer.txt | ||
binary search, quicksort, mergesort
DIVIDE AND CONQUER | ||
| dynamic.txt | ||
dynamic programming is a refinement of a recursive algorithm where previous results are saved in a table
dynamic programming | ||
| greedy.txt | ||
add
greedy algorithms | ||
| --->upload your article | ||
User submitted category site links |
||
(None) | ||
-->submit a page from your site dealing with approaches to the sirfsup! web directory for listing | ||