栈的应用

_02.栈与队列/_d.斐波那契.c

@@ -0,0 +1,34 @@
+#include "stdio.h"
+
+int Fbi(int i)
+{
+    if (i < 2)
+    {
+        return i == 0 ? 0 : 1;
+    }
+    return Fbi(i - 1) + Fbi(i - 2);
+}
+
+int main()
+{
+    int i;
+    int a[40];
+    a[0] = 0;
+    a[1] = 1;
+    printf("%d ", a[0]);
+    printf("%d ", a[1]);
+    for (i = 2; i < 40; i++)
+        
+        {
+            a[i] = a[i - 1] + a[i - 2];
+            printf("%d ", a[i]);
+        }
+    printf("\n");
+    printf("--------------------\n");
+    for (i = 0; i < 40; i++)
+    {
+        printf("%d ", Fbi(i));
+    }
+    getchar();
+    return 0;
+}