A recursive power function : Function Recursive « Function « C / ANSI-C

C / ANSI-C
1. assert.h
2. Console
3. ctype.h
4. Data Structure Algorithm
5. Data Type
6. Development
7. File
8. Function
9. Language Basics
10. Macro Preprocessor
11. Math
12. math.h
13. Memory
14. Pointer
15. setjmp.h
16. signal.h
17. Small Application
18. stdio.h
19. stdlib.h
20. String
21. string.h
22. Structure
23. time.h
24. wctype.h
Microsoft Office Word 2007 Tutorial
Java
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / C Sharp
C# / CSharp Tutorial
ASP.Net
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C Tutorial
C++
C++ Tutorial
PHP
Python
SQL Server / T-SQL
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
C / ANSI-C » Function » Function RecursiveScreenshots 
A recursive power function
A recursive power function

#include <stdio.h>

double power(double x, int n);

int main() {
  double x = 0.0;
  int n = 0;
  for(x = 2.0 ; x<= 5.0; x += 0.5)
    for(n = ; n<; n++)
      printf("%.2lf raised to the power %d = %.2lf\n", x, n, power(x,n));
}

/* Function to raise x to the power n.*/
double power(double x, int n) {
  if(n == 0)
    return 1.0;
  else
    return x * powerx , n - );
}

           
       
Related examples in the same category
1. Calculating factorials using recursion
2. Prints out Fibonacci numbersPrints out Fibonacci numbers
3. Recursive function call
4. Function: Recursive call
5. Copy string using recursion
6. Recursive function with static variable
w___w__w.__j__av___a___2___s___.___c__o___m_ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.