User talk:Pavansai r

EUCLIDS ALGORITHM TO FIND GCD Step 1: Two positive integers, a and b. Step 2: If a<b, exchange a and b. Divide a by b and get the remainder, r. If r=0, report b as the GCD of a and b. Replace a by b and replace b by r. Return to the previous step. Step 3: The greatest common divisor, g, of a and b.

ITINARY Hyderabad – New York City ₹ 44,578 One way, including taxes and fees 1 passenger • Economy View on Google

Thu, 12 January

9:00 PM - 6:35 AM+1 Air India 20h 05m HYD–JFK 1 stop 2h 25m in DEL

GOOGLE PAGE RANKING Google PageRank (Google PR) is one of the methods Google uses to determine a page's relevance or importance. Important pages receive a higher PageRank and are more likely to appear at the top of the search results. Google PageRank (PR) is a measure from 0 - 10. Google Pagerank is based on backlinks. The original PageRank algorithm was described by Lawrence Page and Sergey Brin in several publications. It is given by PR(A) = (1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn)) where

PR(A) is the PageRank of page A,

PR(Ti) is the PageRank of pages Ti which link to page A,

C(Ti) is the number of outbound links on page Ti and

d is a damping factor which can be set between 0 and 1.

DIFFERENT TYPES OF ALGORITHMS

ALGORITHM NAME    -     EXAMPLE

ALGORITHM NAME EXAMPLE

Brute force String matching

Greedy approach Prims algorithm

Divide and conquer Chromatic number problem

Dynamic programming Shortest path problem

Decrease and conquer Graph search algorithm

Transform and conquer Pre-sorting

Branch & bound Integer optimization problems

Back tracking algorithm Solving Sudoku