Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Calculate H.C.F using recursion
//clang 3.8.0 #include <iostream> using namespace std; int hcf(int n1, int n2); int main() { int n1, n2; cout << "Enter two positive integers: "; cin >> n1 >> n2; cout << "H.C.F of " << n1 << " & " << n2 << " is: " << hcf(n1, n2); return 0; } int hcf(int n1, int n2) { if (n2 != 0) return hcf(n2, n1 % n2); else return n1; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Vector examples....
Access namespace by unqualified manner
6 14 15 17 21 33 29
simple in-memory b-tree
Heap: insert and deleteMin() Implementations
U2
Fundamentos de programación. Tema 7. Ejercicio 6.
Tree Example
mddd
applidiumResto_NicolasCarre
Please log in to post a comment.