Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
   
 
  Research
  Publications
  Tutorials
  Resume
  Personal
  Contact

 

Try it Out

By Kardi Teknomo, PhD.

<Previous | Next | VB Tutorial | Contents>

1. Use recursive function to calculate Factorial
2. Use recursive function to calculate Fibonacci number n:

N 1 2 3 4 5 6 7 8 9 10
Fibonacci 1 1 2 3 5 8 13 21 34 55

Users can input any positive integer n and your program will show the Fibonacci number.

3. Use non-recursive procedure (use repetition) to calculate Fibonacci number n as problem 2 above. Compare the code and how the program runs.

<Previous | Next | VB Tutorial | Contents >

Rate this tutorial or give your comments about this tutorial

This tutorial is copyrighted.

Preferable reference for this tutorial is

Teknomo, Kardi. Visual Basic Tutorial . http:\\people.revoledu.com\kardi\ tutorial\VB

 

 

 

 
© 2007 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media