User:15071A05N7/sandbox

1. Euclids Algorithm
The Euclidean Algorithm is a technique for quickly finding the GCD of two integers. The Euclidean Algorithm for finding GCD(A,B) is as follows: *If A = 0 then GCD(A,B)=B, since the GCD(0,B)=B, and we can stop. *If B = 0 then GCD(A,B)=A, since the GCD(A,0)=A, and we can stop. *Write A in quotient remainder form (A = B⋅Q + R). *Find GCD(B,R) using the Euclidean Algorithm since GCD(A,B) = GCD(B,R).

3.Book a ticket
www.lufthansa.com/ 1.to book open the above link. 2.A ticket has to be booked from hyderabad to London city airport. 3.the date of departure is given as 12th jan 2017,the date of returning is given as 24th jan 2017,first class seat is booked. 4.(best time,less no of stops,price) *HYD-BOM-ZRH-LCY->20hr 50min.The cost given is 175,896.00INR.

4.Google pagerank technology
PageRank is an algorithm used by Google Search to rank websites in their search engine results.PageRank works by counting the number and quality                   of links to a page to determine a rough estimate of how important the website is.It is not the only algorithm used by Google to order search engine results, but it is the first algorithm that was used by the company, and it is the best-known.

5.stratergies
1.Brute force=Bubble sort,selection sort; 2.Divide and conquer=Merge sort,Quick sort; 3.Decrease and conquer=insertion sort,BFS,DFS; 4.Transform and conquer=heap,BST,priority queues; 5.Greedy approach=Kruskal's,prim's minimum spanning tree; 6.Dynamic programming=Matrix product; 7.backtracking and branch and bound=DFS,Knapsack; 8.space and time tradeoff's=Horspool's algorithm,boyer-moore;