Implemented generation of Fibbonacci Sequence terms.

Implemented the algorithm for generation of Fibbonacci Sequence terms .
This is an iterative approach to generate and print the first N (input) numeber of terms of the fibonacci sequence .
NOTE: the fibonacci sequence has its first and second terms as 0 and 1 respectively .

Fibonacci_SEQ.cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+void fib(int n) {
+   int f[n];
+   int i;
+   f[0] = 0;
+   f[1] = 1;
+   for (i = 2; i < n; i++) {
+      f[i] = f[i-1] + f[i-2];
+   }
+   for (i = 0; i < n; i++) {
+      cout<<f[i]<<" ";
+   }
+}
+int main () {
+   int n = 10;
+   fib(n);
+   getchar();
+   return 0;
+}