Do it now!

tempResult = [0, 1, 1];

def fibonacci (number):

   if ( number == 1 or number == 2):

      return 1

   if ( tempResult[number] == -1 ): 

      result = fibonacci ( number-1 ) + fibonacci ( number-2 )

      tempResult[number] = result

   return tempResult[number]

for idx in range(3,1001):

    tempResult.insert(idx, -1)   

for idx in range(1,1001):

    print idx," : ",fibonacci(idx)

def fibonacci2 (number):

   if ( number == 1 or number == 2):

      return 1

   previous =  1

   result   =  1

   sum      =  0

   for i in range(3, number+1):

       sum = result + previous

       previous = result

       result = sum

       print i," : ",result

   return result

fibonacci2(1000)    

int arrFibonacci[100000] = { 0, };

int fibonacci ( int number ) {

    int ret = 0;

    if ( number <= 0 ) {

        ret = -1;

    }

    else if ( number == 1 || number == 2  ) {

          ret = 1;    

    } else {

    if ( arrFibonacci[number] == 0 ) { 

            arrFibonacci[number] = fibonacci(number-1) + fibonacci(number-2);  

         }

         ret = arrFibonacci[number];

    }

    return ret;

}

#include <ctime>

using namespace std;

void ellaspedTimeTest() { clock_t start_time; clock_t end_time; start_time = clock();

//Do something ...

end_time = clock(); ellasped_time = (double)(end_time - start_time)/CLOCKS_PER_SEC;

}

switch ( number ) {

    case 1:

         cout << "My "; 

         /* fall through */

    case 2:

         cout << "name ";

         /* fall through */

    case 3:

         cout << "is ";

         /* fall through */

    case 4:

         cout << "H.";

         break;

    default:

          cout << endl;

}

def KMP_Preprocessing(pattern, nSize):

    pi = [0] * (nSize + 1)

    k = -1

    j = 0

    pi[j] = k

    while ( j < nSize ):

        if ( k == -1 or pattern[j] == pattern[k] ):

            j += 1

            k += 1

            pi[j] = k

        else:

            k = pi[k]

    return pi

def KMP_find(text, pattern, ppi):

    nSize = len(text)

    nPSize = len(pattern)

    i = 0

    j = 0

    while (i < nSize):

        if ( j == -1 or text[i] == pattern[j] ): 

            i += 1

            j += 1

        else:    

            j = ppi[j];

        if (j == nPSize):

            print i-j

            j = ppi[j];

strPattern = "ababababca"

strPattern_pi = KMP_Preprocessing(strPattern, len(strPattern) )

strString ="asdsadf9alkjababababcaasdf"

KMP_find(strString, strPattern, strPattern_pi)