DS-Recursion

Recursion/P27_All_Sorted.cpp

@@ -0,0 +1,9 @@
+//For a,b,c we have sort abc acb bac bca cab cba(6 kinds) This Program is to sort all of the kinds
+#include <iostream>
+
+using namespace std;
+
+int main() {
+
+	return 0;
+}

Recursion/P28_19_n!.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+using namespace std;
+int jc(int n){
+    if(n > 0)
+        return jc(n - 1)*n;
+    return 1;
+}
+
+int main(){
+    cout << jc(10) << endl;
+    return 0;
+}

Recursion/P28_20_Feb.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+
+int feb(int n){
+	if(n > 1)
+		return feb(n - 1) + feb(n - 2);
+	return 1;
+}
+
+int main(){
+	for(int i = 1;i < 10; i++){
+		cout << feb(i) << endl;
+	}
+	return 0;
+} 

Recursion/P29_21_ComplexFunc.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+
+int cf(int n){
+	if(n%2 == 1)
+		return cf(3*n + 1);
+	if(n%2 == 0)
+		return n / 2;
+}
+
+int main(){
+	cout << cf(5) << " "<< cf(6) << " " << cf(7) << endl;
+	return 0;
+}

Recursion/P29_22_Ackermann.cpp

@@ -0,0 +1,6 @@
+#include <iostream>
+using namespace std;
+int main(){
+	
+	return 0;
+}