GCD of two numbers in PL/SQL
Prerequisite – PL/SQL introduction
In PL/SQL code groups of commands are arranged within a block. A block group related declarations or statements. In declare part, we declare variables and between begin and end part, we perform the operations.
Given two numbers and task is to find the GCD (Greatest Common Divisor) or HCF (Highest Common Factor) value of the numbers.
Examples:
Input: num1 = 4, num2 = 6 Output: gcd of (num1, num2) = 2 Input: num1 = 8, num2 = 48 Output: gcd of (num1, num2) = 8
Approach is to take two numbers and find their GCD value using Euclidean algorithm.
Below is the required implementation:
DECLARE -- declare variable num1, num2 and t -- and these three variables datatype are integer num1 INTEGER; num2 INTEGER; t INTEGER; BEGIN num1 := 8; num2 := 48; WHILE MOD(num2, num1) != 0 LOOP t := MOD(num2, num1); num2 := num1; num1 := t; END LOOP; dbms_output.Put_line('GCD of ' ||num1 ||' and ' ||num2 ||' is ' ||num1); END; -- Program End |
chevron_right
filter_none
Output :
GCD of 8 and 48 is 8
Recommended Posts:
- PLSQL | COS Function
- PLSQL : || Operator
- PLSQL | LEAST Function
- Difference between SQL and PLSQL
- PLSQL | SIN Function
- PLSQL | MOD Function
- PLSQL | CHR Function
- PLSQL | EXP Function
- PLSQL | LN Function
- PLSQL | TAN Function
- PLSQL | ABS Function
- PLSQL | LOG Function
- PLSQL | INSTR2 Function
- PLSQL | DUMP Function
- PLSQL | RTRIM Function
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
