Recursion/solutionRecursion.js at master · class-b-coding-academy-by-orange/Recursion · GitHub

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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
//1
function sum(num) {
  if (num === 0) {
    return 0;
  }
  return num + sum(n - 1);
}
sum(2)


//2
function factorial(num) {
  if (num === 1) {
    return 1;
  }
  return num * factorial(num - 1);
  // your code here
}
factorial(4);


//3
function repeatStr(str, num) {
  if (num === 1) {
    return str + repeatStr(str, num - 1);
  }
  if (num === 0) {
    return ""
  }
  return str + " " + repeatStr(str, num - 1);
}
repeatStr("to", 2);


//4
function fibon(num) {
  if (num === 1 || num === 0) {
    return 1;
  }
  return fibon(num - 1) + fibon(num - 2);
}
fibon(7)


//5
function sum2(num1, num2) {
  if (num1 === num2) {
    return num2;
  }
  return num1 + sum2(num1 + 1, num2);
}
sum2(3, 6)


//6
function repeatStr2(str1, str2) {
  if (str2.length === 0) {
    return ""
  }
  if (str2.length === 1) {
    return str1 + repeatStr2(str1, str2.slice(1, str2.length))

  }
  return str1 + " " + repeatStr2(str1, str2.slice(1, str2.length))
}
repeatStr2("ro", "fff")


//7
function multiOf(num1, num2, num3) {
  if (num3 === 0) {
    return num1;
  }
  return num2 * multiOf(num1, num2, num3 - 1);
}
multiOf(6, 3, 2)


//8
function multi2(num1, num2) {
  if (num1 > num2) {
    return 1;
  }
  return num1 * multi2(num1 + 1, num2);

}
multi2(3, 6)


//9
function numberBetweenUs(num1, num2) {
  if (num1 === num2 - 1) {
    return "";
  }
  if (num1 === num2 - 2) {
    return (num1 + 1) + numberBetweenUs(num1 + 1, num2);

  }
  return (num1 + 1) + ', ' + numberBetweenUs(num1 + 1, num2);

}
numberBetweenUs(2, 8)


//10
function countDown(num) {
  if (num === 0) {
    return 'done';
  }
  return num + ', ' + countDown(num - 1);
}
countDown(5)


//11
function multiplication2(num1, num2) {
  if (num2 == 0) {
    return 0;
  }
  return num1 + multiplication2(num1, num2 - 1);
}
multiplication2(7, 6)


//12
function mod2(num1, num2) {
  if (num1 > num2 || num1 === num2) {
    return num1 - num2;
  }
  return mod2(num1 - num2, num2);
}
mod2(5, 4)
mod2(4, 4)

// 13
function repeatChar(str1, char) {
  if (str1.length === 0) {
    return 0;
  }
  if (str1[0].toUpperCase() === char.toUpperCase()) {
    return 1 + repeatChar(str1.slice(1, str1.length), char);
  } else {
    return 0 + repeatChar(str1.slice(1, str1.length), char);
  }
}
repeatChar("schOol", "o")
repeatChar("schOol", "L")