-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrecursion-exercies.js
78 lines (70 loc) · 1.43 KB
/
recursion-exercies.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
//1
function loop(number) {
while(number >= 0) {
console.log(number);
number--;
}
}
//2
function loop(number) {
console.log(number);
if(number <=0) {
return;
}
return loop(number - 1);
}
//3
function exponent(base, expo) {
let result = 1;
while(expo > 0) {
result = base * result;
expo--;
}
return result
}
//4
function recursiveExponent(base, expo) {
if(expo <= 0) {
return 1;
}
return base * recursiveExponent(base, expo - 1);
}
//5
//[1,2,3] 3
function recursiveMultiplier(arr, num) {
let length = arr.length;
function recursive(arr, index) {
if(length >=0) {
console.log(arr[index]);
return;
}
recursive(arr, index - 1);
}
recursive(arr, length);
}
//recursiveMultiplier([1,2,3,4], 3);
function recursiveMultiplier(arr, num) {
let newArray = [];
function recursive(length) {
if (length >= arr.length) {
return true;
}
newArray.push(arr[length] * num || 1)
return recursive(length + 1);
}
recursive(0);
return newArray;
}
//recursiveReverse([1,2,3,4,5]);
function recursiveReverse(arr) {
let newArray = [];
function recursive(arr) {
if(arr.length <= 0) {
return true;
}
newArray.push(arr.pop());
return recursive(arr);
}
recursive(arr);
return newArray;
}