local

Author: mostafa-saad

15 C++ Programming 4 Competitions/.~lock.43 C++ Programming 4 Competitions - Recursion_2.pptx#

@@ -0,0 +1 @@
+,moustafa,moustafa-Aspire-VN7-793G,07.06.2020 11:06,file:///home/moustafa/.config/libreoffice/4;

18-Programming-4kids/10_homework_04_answer.cpp

@@ -2,7 +2,7 @@
 using namespace std;
 
 int main() {
-	int n, mn[3];
+	int n, tmp, mn[3];
 
 	cin >> n;
 	for (int i = 0; i < n; i++) {
@@ -24,8 +24,28 @@ int main() {
 		}
 	}
 
+	// let's order the first 3 values. We can do in several ways
+	// Find maximum position
+	int mx_pos = 0;
+	for (int j = 1; j < 3; ++j) {
+		if (mn[mx_pos] < mn[j])
+			mx_pos = j;
+	}
+	// swap max with last
+	tmp = mn[2];
+	mn[2] = mn[mx_pos];
+	mn[mx_pos] = tmp;
+
+	// Swap first 2 elements if needed
+	if (mn[0] > mn[1]) {
+		tmp = mn[0];
+		mn[0] = mn[1];
+		mn[1] = tmp;
+	}
+
 	for (int i = 0; i < 3; i++)
 		cout << mn[i] << " ";	// not ordered
 
+
 	return 0;
 }

18-Programming-4kids/15_1.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+
+int factorial(int n) {
+	int res = 1;
+
+	for (int i = 2; i <= n; ++i)
+		res *= i;
+
+	return res;
+}
+
+int main() {
+	cout << factorial(3) << "\n";	// 1 * 2 * 3
+	cout << factorial(4) << "\n";	// 1 * 2 * 3 * 4
+
+	cout << factorial(5) << "\n";	// 1 * 2 * 3 * 4 * 5            = 120
+									// factorial(4)  * 5			= 120
+
+	cout << factorial(6) << "\n";	// 1 * 2 * 3 * 4 * 5 * 6 		= 720
+									// factorial(5)      * 6 		= 720
+									// factorial(4)  * 5 * 6 		= 720
+									// factorial(3)*4* 5 * 6 		= 720
+
+	return 0;
+}
+

18-Programming-4kids/15_2.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+
+int factorial1() {
+	return 1;	// base case. No subproblems
+}
+
+int factorial2() {
+	return factorial1() * 2;
+}
+
+int factorial3() {
+	return factorial2() * 3;
+}
+
+int factorial4() {
+	return factorial3() * 4;
+}
+
+int factorial5() {
+	return factorial4() * 5;
+}
+
+int factorial6() {
+	return factorial5() * 6;
+}
+
+int main() {
+	cout << factorial6() << "\n";
+	return 0;
+}
+

18-Programming-4kids/15_3.cpp

@@ -0,0 +1,16 @@
+#include<iostream>
+using namespace std;
+
+int factorial(int n) {
+	cout<<"Function Call: factorial: n="<<n<<"\n";
+
+	if (n == 1)
+		return 1;
+	return factorial(n-1) * n;
+}
+
+int main() {
+	cout << factorial(6) << "\n";
+	return 0;
+}
+

18-Programming-4kids/15_4.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+
+void print_triangle(int levels) {
+	if (levels == 0)
+		return;
+
+	for (int i = 0; i < levels; ++i)
+		cout << "*";
+	cout << "\n";
+
+	print_triangle(levels - 1);
+}
+
+int main() {
+	print_triangle(5);
+	return 0;
+}
+

18-Programming-4kids/15_5.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+
+void print_triangle(int levels) {
+	if (levels == 0)
+		return;
+
+	print_triangle(levels - 1);
+
+	for (int i = 0; i < levels; ++i)
+		cout << "*";
+	cout << "\n";
+}
+
+int main() {
+	print_triangle(5);
+	return 0;
+}
+