all products

. Recursion of no. public class AddNumbers { public static void main(String[] args) { int number = 20; int sum = addNumbers(number); System.out.println("Sum = " + sum); } public static int addNumbers(int num) { if (num != 0) return num + addNumbers(num - 1); else return num; } }

find total feet

findLargeSmallDifference CODE IN C: #include int findLargeSmallDifference(int n, int array[]) { int small = array[0], large = 0; for(int i=0; ilarge) { large = array[i];