If you really want to follow it, you can, but keep track of your call stack carefully. main: fun(1) main: fun(1): prints 1 main: fun(1): fun(2): prints 2 main: fun(1): fun(2): fun(3): prints 3 main: fun(1): fun(2): fun(3): fun(4) [1st call]: prints 4 main: fun(1): fun(2): fun(3): fun(4) [1st call]: returns 4 main: fun(1): fun(2): … Read more
The body of an if-statement can be either a compound statement, which is a list of statements surrounded by {}, or it is the single statement following the if‘s condition. That means that this code: if(n>=2) cout<<“number of times the function called: “<<endl; return n*factorial(n-1); is completely equivalent to: if(n>=2){ cout<<“number of times the function … Read more
To determine whether you can create a sum from a list or sublist of numbers: 1) Start with the first number. 2) If that number is equal to the sum you’re trying to create, stop, you’ve succeeded. 3) If that number is greater than the sum you’re trying to create, skip to the next number … Read more
Lambdas can’t call themselves, so it’s not easily doable. You can create the usual named function and call it recursively by name.
If two strings are equal to each other. When comparing two strings, you have to pass in the strings. public static boolean isEquals(String a, String b) { if (a.length() != b.length()) return false; return isEquals(a, b, 0); } private static boolean isEquals(String a, String b, int index) { if (index >= a.length()) return true; if … Read more
The recursive function. void recSeq(int counter){ if (counter <= 0 ) return; // first the exit condition int value = counter -1; recSeq(value ); // go down to the bottom, in order to print values from lovest values to higher System.out.print(” “+(int)Math.pow(2, value )); // print the value } on Exit: recSeq(6); // 1 2 … Read more
what i needed is…(1) in the first iteration i want 10. (2) in the second iteration i want 5, 15. (3) in the third iteration i want 3,8,13,18. and so on. – user4365176 I found a tool (in my libraries) which I used to transfer the contents of a vector (of non-decreasing integers) TO a … Read more
While @SamGrondahl is on the right track, unfortunately, if you enter a negative number it gives unexpected results. This should work properly with negative numbers: int sumdigits(int number) { int sign = number < 0 ? -1 : 1; number = sign * number; // abs the number if (number < 10) return sign * … Read more
You can simply return the value you are interested in: function countElements(arr) { var count = 0; for (var i=0; i<arr.length; i++) { if (arr[i] instanceof Array) { count += countElements(arr[i]); // recursion here } else { count++; // normal element counts as 1 } } return count; } Demo: http://jsbin.com/ejEmOwEQ/1/edit WARNING: The function might … Read more
Is recursion really necessary in order to map two objects of the same type? Could you not use AutoMapper . As the objects are of the same type mapping their property is straight forward. Moreover you have control over what member to include or whether to override or combine source and destination etc. This is … Read more