programs of for Finding GCD no and program for arranging array in ascending and descending order
Sigiloso
It can be done using recursion. Following is the function which gives the gcd of two no. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }