Deutsch

Finden Sie G.C.D mit Rekursion. Kotlin

Finden Sie G.C.D mit Rekursion. Kotlin

#GCD #kotlin

Kotlin

xxxxxxxxxx
 
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
}

Output result

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

Kotlin

Codebeispiele und Antworten auf Fragen in der Kotlin-Programmiersprache

Hot Network Questions

BeeCoder.ORG

open source code and examples

We have been online since 2021 and 1 millions of people around the globe have visited our website since then

More visitors every month