first thought using recursive.Very slow

OneCodeMonkey · OneCodeMonkey · commit bb68a892ab7a · 2019-05-13T18:54:30.000+08:00
diff --git a/fibonacci/test.c b/fibonacci/test.c
@@ -0,0 +1,23 @@
+// test data structure:sequence_list
+#include<stdio.h>
+#include<stdlib.h>
+
+int fibonacci(int i) {
+	if (i <= 0) {
+		return 0;
+	}
+	if (i == 1 || i == 2) {
+		return 1;
+	}
+	return fibonacci(i - 1) + fibonacci(i - 2);
+}
+
+
+int main() {
+	printf("__________________");
+	int num_100 = fibonacci(45);
+	printf("%d\n", num_100);
+	printf("__________________");
+	system("pause");
+	return 0;
+}
