Skip to main content

gcd using euclids algorithm

GCD stands for greatest common divisor. GCD of two numbers is the greatest number that divides both numbers without leaving a remainder. Euclidean algorithm for finding the gcd is based on the principle that the gcd of two numbers does not change if the larger number is replaced by its difference with the smaller number.
Let us consider the example of 206 and 40, we find that 2 is the gcd of 206 and 40 also according to the above statement the gcd of 166 (206 - 40) and 40 is also 2.

To know more about GCD click here.

In the below program we follow the below steps

  • Step 1: In each iteration calculate the quotient 
  • Step 2: Then subtract the product of quotient and the smaller number from the bigger number
  • Step 3: Replace the bigger number by the remainder. 
  • Step 4: Repeat above steps until the smaller number becomes 0

GCD using euclids algorithm

C++ Program

Sample input and output to check the program

You might also be interested in 

Finding factorial of a number

Finding the next smallest palindrome
Finding square root of a number using Babylonian method
Finding Armstrong numbers
Bar Graph in c using DDA Line Algorithm


Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)

We first revers…

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.

now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.


Home Page