Run Code
|
API
|
Code Wall
|
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
my override
Combination
vf
regimeketopdfb
Bubble Sort Example
Initialise arrays with N number
test
is_convertible
A
Range List for C++