R2:Function&Recursion

1. Write a program to find the power of a number
2. Write a program to find cube of a number
3. Write a program to find the sum of all elements of the array
4. Write a program to find nth Fibonacci term
5. Write a program to find GCD of two number
6. Write a program to find LCM of two number
7. Write a program to find the factorial of any number
8. Write a program to display all array elements
9. Write a program to print even or odd numbers in given range
10. Write a program to check whether a number is prime or perfect number
11. Write a program to search a character in a string using binary search
12. Write a program to read a string through keyboard and sort it using bubble sort

Read more

Write a program to read a string through keyboard and sort it using bubble sort

With Function:

1. #include<stdio.h>
2. #include<string.h>
3. void bubbleSort(char str[25][25], char temp[25],int n)
4. {
5.     int i,j;
6.     for(i=0; i<=n; i++) {
7.         for (j = i + 1; j <= n; j++) {
8.             if (strcmp(str[i], str[j]) > 0) {
9.                 strcpy(temp, str[i]);
10.                 strcpy(str[i], str[j]);
11.                 strcpy(str[j], temp);
12.             }
13.         }
14.     }
15. }
16. int main(){
17.     int i, j, n;
18.     char str[25][25], temp[25];
19.     printf("Enter the number of string : ");
20.     scanf("%d", &n);
21. 
    
22.     printf("\nEnter %d strings : \n", n);
23.     for(i=0; i<=n; i++)
24.         gets(str[i]);
25. 
    
26.     bubbleSort(str,temp,n);
27. 
    
28.     printf("\n\nSorted Strings :");
29.     for(i=0; i<=n; i++)
30.         puts(str[i]);
31. 
    
32.     return 0;
33. }

With Recursion:

1. #include<stdio.h>
2. #include<string.h>
3. void bubbleSort(char str[25][25], char temp[25],int n)
4. {
5.     if (n == 0)
6.         return;
7.     int i,j;
8.     for(i=1; i< n; i++) {
9.             if (strcmp(str[i], str[i+1]) > 0) {
10.                 strcpy(temp, str[i]);
11.                 strcpy(str[i], str[i+1]);
12.                 strcpy(str[i+1], temp);
13.             }
14.         }
15.     bubbleSort(str,temp, n-1);
16. }
17. int main(){
18.     int i, j, n;
19.     char str[25][25], temp[25];
20.     printf("Enter the number of string : ");
21.     scanf("%d", &n);
22. 
    
23.     printf("\nEnter %d strings : \n", n);
24.     for(i=0; i<=n; i++)
25.         gets(str[i]);
26. 
    
27.     bubbleSort(str,temp,n);
28. 
    
29.     printf("\n\nSorted Strings :");
30.     for(i=0; i<=n; i++)
31.         puts(str[i]);
32. 
    
33.     return 0;
34. }

Read more

Write a program to search a character in a string using binary search

with function:

1. #include <stdio.h>
2. #include <string.h>
3. 
   
4. int func(char str[100][100],int start,int end,char key[40])
5. {
6.     while(start <= end)
7.     {
8.         int mid = (start+end)/2;
9.         if (strcmp(key, str[mid])==0)
10.         {
11.             printf("key found at the position %d\n", mid+1);
12.             return 0;
13.         }
14.         else if
15.                 (strcmp(key, str[mid])>0)
16.         {
17.             end = end;
18.             start = mid+1;
19.         }
20. 
    
21.         else
22.         {
23.             start=start;
24.             end = mid-1;
25.         }
26.     }
27.     return -1;
28. 
    
29. }
30. int main()
31. {
32.     int i, n, start, end, mid;
33.     char str[100][100], key[40];
34. 
    
35.     printf("Please enter the number of string to be stored : ");
36.     scanf("%d",&n);
37. 
    
38.     printf("Enter the string in ascending order\n");
39. 
    
40.     for(i=0; i<=n-1; i++)
41.     {
42.         scanf("%s", &str[i]);
43.     }
44. 
    
45.     printf("Enter the string to be searched : ");
46.     scanf("%s", &key);
47. 
    
48.     start = 0;
49.     end = n-1;
50.     if(func(str,start,end,key)==-1)
51.         printf("Failed\n");
52.     return 0;
53. }

with recursion:

1. #include <stdio.h>
2. #include <string.h>
3. 
   
4. int recursion(char str[100][100],int start,int end,char key[40])
5. {
6.     if(start>end)
7.         return -1;
8.     int mid = (start+end)/2;
9.     if(strcmp(key, str[mid])==0)
10.     {
11.         printf("key found at the position %d\n", mid+1);
12.         return 0;
13.     }
14.     else if(strcmp(key, str[mid])>0)
15.     {
16.         recursion(str,mid+1,end,key);
17.     }
18.     else
19.     {
20.         recursion(str,start,mid-1,key);
21.     }
22. 
    
23. }
24. int main()
25. {
26.     int i, n, start, end, mid;
27.     char str[100][100], key[40];
28. 
    
29.     printf("Please enter the number of string to be stored : ");
30.     scanf("%d",&n);
31. 
    
32.     printf("Enter the string in ascending order\n");
33. 
    
34.     for(i=0; i<=n-1; i++)
35.     {
36.         scanf("%s", &str[i]);
37.     }
38. 
    
39.     printf("Enter the string to be searched : ");
40.     scanf("%s", &key);
41. 
    
42.     start = 0;
43.     end = n-1;
44.     if(recursion(str,start,end,key)==-1)
45.         printf("Failed\n");
46.     return 0;
47. }

Read more

Write a program to check whether a number is prime or perfect number

Write a program to check whether a number is prime or perfect number.
Used function

1. #include <stdio.h>
2. #include <math.h>
3. 
   
4. int Prime(int num);
5. int Perfect(int num);
6. 
   
7. 
   
8. int main()
9. {
10.     int num;
11.     
12.     printf("Enter a number to check Prime or Perfect number : ");
13.     scanf("%d", &num);
14.     
15.     if(Prime(num)) {
16.         printf("%d is Prime number.\n", num);
17.     }
18.     else {
19.         printf("%d is not Prime number.\n", num);
20.     }
21.     
22.     if(Perfect(num)) {
23.         printf("%d is Perfect number.\n", num);
24.     }
25.     else {
26.         printf("%d is not Perfect number.\n", num);
27.     }
28.     
29.     return 0;
30. }
31. 
    
32. int Prime(int num) 
33. {
34.     int i;
35.     
36.     for(i=2; i<=num/2; i++) {
37.         if(num%i == 0)  
38.         {
39.             return 0;
40.         }  
41.     } 
42.     
43.     return 1; 
44. }
45. 
    
46. int Perfect(int num) 
47. {
48.     int i, sum, n;
49.     sum = 0;
50.     n = num;
51.     
52.     for(i=1; i<n; i++) {
53.         if(n%i == 0) {  
54.             sum += i;  
55.         }  
56.     }
57.     
58.     return (num == sum);
59. }

Used recursion

1. #include <stdio.h>
2. #include <math.h>
3. 
   
4. int Prime(int i, int num);
5. int Perfect(int i, int num,int sum);
6. 
   
7. int main()
8. {
9.     int num;
10. 
    
11.     printf("Enter a number to check Prime or Perfect number : ");
12.     scanf("%d", &num);
13. 
    
14.     if(Prime(2,num)) {
15.         printf("%d is Prime number.\n", num);
16.     }
17.     else {
18.         printf("%d is not Prime number.\n", num);
19.     }
20. 
    
21.     if(Perfect(1,num,0)) {
22.         printf("%d is Perfect number.\n", num);
23.     }
24.     else {
25.         printf("%d is not Perfect number.\n", num);
26.     }
27.     return 0;
28. }
29. 
    
30. int Prime(int i, int num)
31. {
32.     if(i > num / 2){
33.         return 1;
34.     }
35.     if(num % i == 0){
36.         return 0;
37.     }
38.     Prime(i+1,num);
39. }
40. int Perfect(int i, int num,int sum)
41. {
42.     if(i == num){
43.         return (num == sum);
44.     }
45.     if(num % i == 0){
46.         Perfect(i+1,num,sum+i);
47.     }else{
48.         Perfect(i+1,num,sum);
49.     }
50. }

Read more

Write a program to print even or odd numbers in given range

Write a program to print even or odd numbers in given range.
Using function

1. #include <stdio.h>
2. 
   
3. int even(int lowerLimit, int upperLimit)
4. {
5.     int i, r, count=0;
6.     printf("\nDisplay the even numbers between %d and %d are: ", lowerLimit, upperLimit);
7.     for(i=lowerLimit; i<=upperLimit; i++){
8.         r = i%2;
9.         if(r == 0) {
10.            printf("%3d", i);
11.            count++;
12.         }
13.     }
14.     //printf("\n\nTotal even numbers between %d and %d are: %d", lowerLimit, upperLimit, count);
15. }
16. 
    
17. int odd(int lowerLimit, int upperLimit)
18. {
19.     int i,r,count=0;
20.       printf("\n\nDisplay the odd numbers between %d and %d are: ",lowerLimit, upperLimit);
21.     for(i=lowerLimit; i<=upperLimit; i++){
22.         r=i%2;
23.         if(r==1) {
24.             printf("%3d",i);
25.             count++;
26.             }
27.     }
28.     //printf("\n\nTotal odd numbers between %d and %d are:  %d", lowerLimit, upperLimit, count);
29. }
30. int main()
31. {
32.     int lowerLimit, upperLimit;
33.     printf("Enter lower limit : ");
34.     scanf("%d", &lowerLimit);
35.     
36.     printf("Enter upper limit : "); //Enter the second number for range
37.     scanf("%d", &upperLimit);
38.     
39.     even(lowerLimit, upperLimit);
40.     odd(lowerLimit, upperLimit);
41.     return 0;
42. }

Recursion

1. #include <stdio.h>
2. 
   
3. void printEvenOdd(int num, int limit);
4. int main()
5. {
6.     int lowerLimit, upperLimit;
7.     printf("Enter lower limit : ");
8.     scanf("%d", &lowerLimit);  
9. 
   
10.     printf("Enter upper limit : ");
11.     scanf("%d", &upperLimit);
12. 
    
13.     printf("Even or odd numbers from %d to %d given range are : ", lowerLimit, upperLimit);
14.     printEvenOdd(lowerLimit, upperLimit);
15. 
    
16.     return 0;
17. }
18. 
    
19. void printEvenOdd(int num, int limit)//recursive function
20. {
21.     if(num > limit)
22.         return;
23.     printf("%4d",num);
24. 
    
25.     printEvenOdd(num+2, limit);
26. }

Read more

Write a program to display all array elements

Write a program to display all array elements.
using function

1. #include <stdio.h>
2. 
   
3. int input(int *arr, int n)
4. { 
5.     int i;
6.     
7.     for(i=0; i<n; i++) {
8.         scanf("%d", &arr[i]);
9.     }
10. }
11.      
12. int display(int *arr, int n)
13. { 
14.     int i;
15.     
16. for(i=0; i<n; i++) {
17.         printf("%5d", arr[i]);
18.     }
19. }
20.  
21. int main()
22. {
23.     int arr[100], i, n;  
24.  
25.     printf("Enter the size of array: ");
26.     scanf("%d", &n);
27.  
28.     printf("Enter %d elements in the array : ", n);
29.     input(arr, n);
30.     printf("\nElements in array are : ");
31.     
32.     display(arr, n);
33.     return 0;
34. }

Recursion recursion

1. #include <stdio.h>
2. 
   
3. int input(int *arr,int i, int n)
4. { 
5.      
6.    if(i<n) {
7. scanf("%d", &arr[i]);
8.         input(arr, i+1, n);
9.     }
10. }
11.      
12. int display(int *arr,int i,int n)
13. { 
14.      if(i<n) {
15.         printf("%d  ", arr[i]);
16.         display(arr,i+1,n);
17.     }
18. }
19. 
    
20. int main()
21. {
22.     int arr[100],i,n;  
23.  
24.     printf("Enter the size of array: ");
25.     scanf("%d", &n);
26.  
27.     printf("Enter %d elements in the array : ", n);
28.     input(arr,0,n);
29.     printf("\nElements in array are: ");
30.     display(arr, 0, n);
31.  
32.     return 0;
33. }

Read more

Write a program to find the factorial of any number

Write a program to find the factorial of any number.
using function 

1. #include <stdio.h>
2. int fact(int);
3.  
4. void main()
5. {
6.  int num, factorial;
7.  
8.   printf("Please enter any number to find factorial : ");
9.   scanf("%d",&num);
10.   factorial=fact(num);
11.     printf("The number %d factorial is = %d\n",num,factorial);
12.     //printf("Factorial of the number (%d) = %d\n",num,fact(num));
13. }
14.  
15. int fact(int n)
16. {
17.     int i,f=1;
18.     for(i=1;i<=n;i++) {
19.         f=f*i;
20.     }
21.     return f;
22. }

Recursion:

1. #include <stdio.h>
2. 
   
3. int fact(int n)
4. {
5.     if(n==0)
6.         return 1;
7.     else 
8.         return (n*fact(n-1));
9. }
10.  
11. void main()
12. {
13.     int num;
14.     printf("Please enter any number to find factorial : ");
15.     scanf("%d", &num);
16.     printf("The number %d factorial is = %d\n",num,fact(num));
17. }

Read more

Write a program to find LCM of two number

Write a program to find LCM of two number
using function

1. #include <stdio.h>
2. int gcd(int, int);
3. 
   
4. int main() {
5.   int n1, n2, lcm_gcd, lcm;
6. 
   
7.   printf("Enter two numbers to find LCM : ");
8.   scanf("%d %d", &n1, &n2);
9. 
   
10.   lcm_gcd = gcd(n1, n2);
11.   lcm = (n1*n2)/lcm_gcd;
12. 
    
13.   //printf("\n%d and %d of GCD is = %d\n", n1, n2, lcm_gcd);
14.   printf("\n%d and %d of LCM is = %d\n", n1, n2, lcm);
15. 
    
16.   return 0;
17. }
18. 
    
19. int gcd(int n1, int n2) {
20.   if (n1 == 0) {
21.     return n2;
22.   }
23. 
    
24.   while (n2 != 0) {
25.     if (n1 > n2) {
26.       n1 = n1-n2;
27.     }
28.     else {
29.       n2 = n2-n1;
30.     }
31.   }
32.   return n1;
33. }

Recursion recursion

1. #include <stdio.h>
2. int gcd(int, int);
3. 
   
4. int main() {
5.   int n1, n2, lcm_gcd, lcm;
6. 
   
7.   printf("Enter two numbers to find LCM : ");
8.   scanf("%d %d", &n1, &n2);
9. 
   
10.   lcm_gcd = gcd(n1, n2);
11.   lcm = (n1*n2)/lcm_gcd;
12. 
    
13.   //printf("\n%d and %d of GCD is = %d\n", n1, n2, lcm_gcd);
14.   printf("\n%d and %d of LCM is = %d\n", n1, n2, lcm);
15. 
    
16.   return 0;
17. }
18. 
    
19. int gcd(int m, int n) {
20.   if (n == 0) {
21.     return m;
22.   }
23.   else {
24.     return gcd(n, m%n);
25.   }
26. }

Read more

Write a program to find GCD of two number

Write a program to find GCD of two number.
using function

1. #include<stdio.h>
2. int find_gcd(int n1, int n2);
3. 
   
4. int main() {
5.     int n1, n2;
6.     printf("Enter two numbers to find GCD : ");
7.     scanf("%d %d", & n1, & n2);
8.     
9.     printf("\n%d and %d of GCD is: %d\n\n", n1, n2, find_gcd(n1, n2));
10.  
11.     return 0;
12.  }
13. int find_gcd(int n1, int n2) {
14.   if (n2 == 0)
15.     return n1;
16.   else
17.     return find_gcd(n2, n1 % n2);
18. }

Using recursion 

1. #include<stdio.h>
2. 
   
3. int find_gcd(int , int );
4. 
   
5. int main()
6. {
7.     int n1, n2, gcd;
8.     printf("Enter two numbers to find GCD : ");
9.     scanf("%d%d", &n1, &n2);
10.     
11.     gcd = find_gcd(n1, n2);
12.     printf("\n%d and %d of GCD is: %d\n\n", n1, n2, gcd);
13. 
    
14.     return 0;
15. }
16. 
    
17. int find_gcd(int x, int y)
18. {
19.     if(x > y)
20.         find_gcd(x-y, y);
21. 
    
22.     else if(y > x)
23.         find_gcd(x, y-x);
24.     else
25.         return x;
26. }

Read more

Write a program to find nth Fibonacci term

Write a program to find nth Fibonacci term
Used function

1. #include<stdio.h> 
2.   
3. int fibo(int num) 
4. {
5.   int fibonacci[num+2];
6.   int i; 
7.   
8.   fibonacci[0] = 0; 
9.   fibonacci[1] = 1; 
10.   
11.   for (i = 2; i <= num; i++) { 
12.       fibonacci[i] = fibonacci[i-1] + fibonacci[i-2]; 
13.   } 
14.   
15.   return fibonacci[num]; 
16. } 
17.   
18. int main() { 
19.     int num; 
20.     printf("Enter the number to find nth fiboacci term : ");
21.     scanf("%d", &num);
22. 
    
23.     int first=0, second=1, third;
24.     printf("%4d%4d", first, second);
25.     for(int i=3; i <= num; i++) {
26.         third=first+second;
27.         first=second;
28.         second=third;
29.         printf("%4d", third);
30.     }
31. 
    
32.     printf("\n\n%dᵗʰ fibonacci term is : %d", num, fibo(num));
33.     return 0; 
34. }

Recursion

1. #include <stdio.h>
2. 
   
3. int fibo(int num);
4. 
   
5. int main()
6. {
7.     int num;
8.     int fibonacci;
9.   
10.     printf("Enter the number to find nth fiboacci term : ");
11.     scanf("%d", &num);
12.    
13.     int first=0, second=1, third;
14.     printf("%4d%4d", first, second);
15.     for(int i=3; i <= num; i++) {
16.         third=first+second;
17.         first=second;
18.         second=third;
19.         printf("%4d", third);
20. }
21. 
    
22.     if(num < 0) {
23.         printf("Fibonacci of negative number is not possible.\n");
24.     }
25.     else {
26.         fibonacci = fibo(num);
27.         printf("The %dᵗʰ fibonacci term is : %d\n", num, fibonacci);
28.     }
29.    /* //or (this one is also correct) 
30.     fibonacci = fibo(num); 
31.     printf("%dᵗʰ fibonacci term is : %d", num, fibonacci);
32.     */
33.     return 0;
34. }
35. 
    
36. int fibo(int num) 
37. {
38.     if(num == 0)
39.         return 0;
40.     else if(num == 1)
41.         return 1;
42.     else 
43.         return fibo(num-1) + fibo(num-2); 
44. }

Read more

Write a program to find the sum of all elements of the array

Write a program to find the sum of all elements of the array.
Used function

1. #include <stdio.h>
2. 
   
3. int element(int arr[], int n)
4. {
5.     int sum = 0;
6.   
7.     for(int i = 0; i < n; i++) {
8.         sum = sum + arr[i];
9.     }
10.   
11.     return sum;
12. }
13.   
14. int main()
15. {
16.     int arr[100];
17.     int total = 0;
18.     int i, n;
19.     
20.     printf("Enter the number of elements to be stored in the array : ");
21.     scanf("%d", &n);
22. 
    
23.     printf("Enter %d elements in the array :\n", n);
24.     for(i=0; i<n; i++) {
25.           printf("Element - %d : ", i);
26.           scanf("%d", &arr[i]);
27.         }
28.   
29.     total = element(arr, n);
30.   
31.     printf("Sum of all elements of array is : %d", total);
32.   
33.     return 0;
34. }

Used recursion

1. #include <stdio.h>
2. 
   
3. int element(int arr[], int n, int i)
4. {
5.     if(i<n)
6.         return arr[i]+element(arr, n, ++i);
7.    
8.         return 0;
9. }
10.   
11. int main()
12. {
13.     int arr[100];
14.     int total = 0;
15.     int i, n;
16.     
17.     printf("Enter the number of elements to be stored in the array : ");
18.     scanf("%d", &n);
19. 
    
20.     printf("Enter %d elements in the array :\n", n);
21.     for(i=0; i<n; i++) {
22.           printf("Element - %d : ", i);
23.           scanf("%d", &arr[i]);
24.         }
25.   
26.     total = element(arr, n, 0);
27.   
28.     printf("Sum of all elements of array is : %d", total);
29.   
30.     return 0;
31. }

Read more

Write a program to find cube of a number

Write a program to find cube of a number.
Used Function

1. #include <stdio.h>
2. 
   
3. int cube(int num);
4. 
   
5. int main()
6. {
7.     int num;
8.     int c;
9.     
10.     printf("Please enter a number: ");
11.     scanf("%d", &num);
12.     
13.     c = cube(num);
14. 
    
15.     printf("Cube of %d is : %d", num, c); 
16.     
17.     return 0;
18. }
19. 
    
20. int cube(int num) {
21.     return (num*num*num);
22. }

Used Recursion

http://www.chanduthedev.com/2013/11/cube-of-a-number-using-recursion-in-c.html

#include<stdio.h>

int iterator = 2;
int givenValue=0;
int cube(int num)
{
  if(!iterator)
  {
    printf("Cube of %d is : %d ", givenValue, num/givenValue);
    return;
  }
  else
  {
    iterator--;
    cube(num*num);
  }
}

int main()
{
  int n=0;
  printf("Enter the number to find the cube\n");
  scanf("%d",&givenValue);
  cube(givenValue);
}



//maybe the below program is incorrect

1. #include <stdio.h>
2. 
   
3. int cube(int);
4. 
   
5. int main()
6. {
7.     int n;
8.     int c;
9.     
10.     printf("Please enter a number: ");
11.     scanf("%d", &n);
12.     
13.     c = cube(n);
14. 
    
15.     printf("Cube of %d is : %d", n, c); 
16.     
17.     return 0;
18. }
19. 
    
20. int cube(int num) {
21.     return (num*num*num);
22. }

Read more

Write a program to find the power of a number

Write a program to find the power of a number.

Used Function

1. #include<stdio.h>
2. void power(int,int);
3.  
4. void main() 
5. {
6.     int base, expo;
7.     printf("Enter the base : ");
8.     scanf("%d",&base);
9.     
10.     printf("Enter the exponent : ");
11.     scanf("%d",&expo);
12.     
13.     power(base, expo);
14. }
15.  
16. void power(int base, int expo)
17. {
18.     int power=1;
19.     while(expo>0)
20.     {
21.         power=power*base;
22.         expo--;
23.     }
24.     printf("\nPower of the number is = %d", power);
25. }

Recursion

1. #include <stdio.h>
2.  
3. int power(int base, int expo)
4. {
5.     if(expo==0)
6.         return 1;
7.     else 
8.         return (base*power(base, expo-1));
9. }
10.  
11. void main()
12. {
13.     int base, expo;
14.     printf("Enter the base : ");
15.     scanf("%d", &base);
16.     
17.     printf("Enter the exponent : ");
18.     scanf("%d", &expo);
19.     
20.     printf("\nPower of the number is (%d^%d) = %d", base, expo, power(base, expo));
21. }

Read more