The recursion for foldr f x ys where ys = [y1,y2,…,yk] looks like f y1 (f y2 (… (f yk x) …)) whereas the recursion for foldl f x ys looks like f (… (f (f x y1) y2) …) yk An important difference here is that if the result of f x y can … Read more
The time complexity, in Big O notation, for each function: int recursiveFun1(int n) { if (n <= 0) return 1; else return 1 + recursiveFun1(n-1); } This function is being called recursively n times before reaching the base case so its O(n), often called linear. int recursiveFun2(int n) { if (n <= 0) return 1; … Read more
Usually, I replace a recursive algorithm by an iterative algorithm by pushing the parameters that would normally be passed to the recursive function onto a stack. In fact, you are replacing the program stack by one of your own. var stack = []; stack.push(firstObject); // while not empty while (stack.length) { // Pop off end … Read more