REKURZIVNO PROGRAMIRANJE: VJEŽBA C19
Ponovo napiši primjer
c9 tako da upotrijebiš rekurzivnu funkciju.
#include <stdio.h> long int triang_rec( long int ); long int triang_rec( long int number ) { long int result; if( number == 0l ) result = 0l; else result = number + triang_rec( number - 1 ); return( result ); } main () { int request; long int triang_rec(), answer; printf("Enter number to be calculated.\n"); scanf( "%d", &request); answer = triang_rec( (long int) request ); printf("The triangular answer is %l\n", answer); }
Upamtimo i ovu verziju funkcije triang_rec #include <stdio.h> long int triang_rec( long int ); long int triang_rec( long int number ) { return((number == 0l) ? 0l : number*triang_rec( number-1)); }
©Copyright B Brown. 1984-1998. All rights reserved.