Course

Introduction

Print an Integer (Entered by the User)Add Two Integers Multiply two Floating Point Numbers Find ASCII value of a character Compute Quotient and Remainder Swap Two Numbers Check Whether a Number is Even or Odd Find the Frequency of Character in a String Remove All Whitespaces from a String Round a Number to n Decimal Places

Decision Making and Loop

Check Whether an Alphabet is Vowel or Consonant Find the Largest Among Three Numbers Find all Roots of a Quadratic Equation Check Leap Year Check Whether a Number is Positive or Negative Check Whether a Character is Alphabet or Not Calculate the Sum of Natural Numbers Find Factorial of a Number Generate Multiplication Table Display Fibonacci Series Find GCD of two Numbers Find LCM of two Numbers Display Characters from A to Z using loop Count Number of Digits in an Integer Reverse a Number Calculate the Power of a Number Check Whether a Number is Palindrome or Not Check Whether a Number is Prime or Not Display Prime Numbers Between Two Intervals Check Armstrong Number Display Armstrong Number Between Two Intervals Display Factors of a Number Make a Simple Calculator Using switch...case Count the Number of Vowels and Consonants in a Sentence Sort Elements in Lexicographical Order (Dictionary Order)Create Pyramid and Pattern

Functions

Display Prime Numbers Between Intervals Using Function Display Armstrong Numbers Between Intervals Using Function Check Whether a Number can be Expressed as Sum of Two Prime Numbers Find the Sum of Natural Numbers using Recursion Find Factorial of a Number Using Recursion Find G.C.D Using Recursion Convert Binary Number to Decimal and vice-versa Convert Octal Number to Decimal and vice-versa Convert Binary Number to Octal and vice-versa Reverse a Sentence Using Recursion calculate the power using recursion

Arrays

Calculate Average Using Arrays Find Largest Element in an Array Calculate Standard Deviation Add Two Matrix Using Multi-dimensional Arrays Multiply to Matrix Using Multi-dimensional Arrays Multiply two Matrices by Passing Matrix to a Function Find Transpose of a Matrix Print an Array Concatenate Two Arrays Convert Character to String and Vice-Versa Check if An Array Contains a Given Value

Collections

Join Two Lists Convert List (ArrayList) to Array and Vice-Versa Convert Map (HashMap) to List Convert Array to Set (HashSet) and Vice-Versa Sort a Map By Values

Object and Class

Add Two Complex Numbers by Passing Class to a Function Calculate Difference Between Two Time Periods

Advanced

Convert String to Date Get Current Date/TIme Convert Milliseconds to Minutes and Seconds Add Two Dates Get Current Working Directory Convert Byte Array to Hexadecimal Create String from Contents of a File Append Text to an Existing File Convert a Stack Trace to a String Convert File to byte array and Vice-Versa Convert InputStream to String Convert OutputStream to String Lookup enum by String value Compare Strings Sort ArrayList of Custom Objects By Property Check if a String is Numeric

Kotlin Program to Find G.C.D Using Recursion

This program takes two positive integers and calculates GCD using recursion.

Visit this page to learn how you can calculate the GCD using loops.

Example: GCD of Two Numbers using Recursion


              
fun main(args: Array<String>) {
    val n1 = 366
    val n2 = 60
    val hcf = hcf(n1, n2)

    println("G.C.D of $n1 and $n2 is $hcf.")
}

fun hcf(n1: Int, n2: Int): Int {
    if (n2 != 0)
        return hcf(n2, n1 % n2)
    else
        return n1
}

When you run the program, the output will be:


              
G.C.D of 366 and 60 is 6.

In the above program, the recursive function is called until n2 is 0. In the end, the value of n1 is the GCD or HCF of the given two numbers.

Execution Steps

No.	Recursive call	n1	n2	n1 % n2
1	hcf(366, 60)	366	60	6
2	hcf(60, 6)	60	6	0
Final	hcf(6, 0)	6	0	-

Here’s the equivalent Java code: Java Program to Find G.C.D. using recursion