User:DAAM5/sandbox

PAGE RANKING::

PageRank is an algorithm used by the Google search engine to measure the authority of a webpage. While the details of PageRank are proprietary, it is generally believed that the number and importance of inbound links to that page are a significant factor. PageRank was the original concept behind the creation of Google. The value of PR is between 0 to 10

For more information you can visit www.techopedia.com

You can visit www.prchecker.info to check a website PR

EUCLID ALGORITHM::

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for more general rings than just the integers Z. There are even principal rings which are not Euclidean but where the equivalent of the Euclidean algorithm can be defined. The algorithm for rational numbers was given in Book VII of Euclid's Elements.

For more info you can visit www.rit.edu

ALGORITHM DESIGN STRATEGIES

BRUTE FORCE::

Brute force is a straightforward approach to solve a problem based on the problem’s statement and definitions of the concepts involved. It is considered as one of the easiest approach to apply and is useful for solving small – size instances of a problem.

Examples are: bubble sort,selection sort,sequential search

DIVIDE AND CONQUER::

Divide-and-conquer is a top-down technique for designing algorithms that consists of dividing the problem into smaller subproblems hoping that the solutions of the subproblems are easier to find and then composing the partial solutions into the solution of the original problem

Examples are: Binary search in sorted array,merge sort,quick sort

DECREASE AND CONQUER::

Algorithms that use a factor of 2 are also known as divide-and-conquer algorithms. Binary search is a typical example. Decrease by a constant factor algorithms are very efficient especially when the factor is greater than 2 as in the fake-coin problem.

Examples are: Insertion sort,Topological sorting

TRANSFORM AND CONQUER::

divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.

Examples are: AVL trees O(nlogn) search time, least common multiple

GREEDY APPROACH::

A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.

Examples are: Minimal spanning tree,Shortest distance in graphs

DYNAMIC PROGRAMMING::

Dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler sub problems, solving each of those subproblems just once, and storing their solutions.

Examples are: Fibonacci numbers computed by iteration,Warshall’s algorithm implemented by iterations

BACKTRACKING AND BRANCH AND BOUND::

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed.

Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search: the set of candidate solutions is thought of as forming a rooted tree with the full set at the root.

Examples are: State-space search problems,8-puzzle problem

For more info visit faculty.simpson.edu