-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathassignment13.c
206 lines (194 loc) · 4.32 KB
/
assignment13.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
/* Assignment - 13 A Job Ready Bootcamp in C++, DSA and IOT MySirG
More on Recursion in C Language*/
//1. Write a recursive function to calculate sum of first N natural numbers
/*#include<stdio.h>
int sum_natural(int );
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf(" sum of natural number is %d",sum_natural(number));
return 0;
}
int sum_natural(int n)
{
if(n>1)
return n+sum_natural(n-1);
}*/
//2. Write a recursive function to calculate sum of first N odd natural numbers
/*#include<stdio.h>
int sum_odd(int);
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf(" sum of odd natural number is : %d",sum_odd(number));
return 0;
}
int sum_odd(int n)
{
if(n>1)
return 2*n-1+sum_odd(n-1);
}*/
//3. Write a recursive function to calculate sum of first N even natural numbers
/*#include<stdio.h>
int sum_even(int);
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf(" sum of even natural number is : %d",sum_even(number));
return 0;
}
int sum_even(int n)
{
if(n>0)
return 2*n+sum_even(n-1);
}*/
//4. Write a recursive function to calculate
//sum of squares of first n natural numbers
/*#include<stdio.h>
int square(int );
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf("square of n natural number is :%d",square(number));
return 0;
}
int square(int n)
{
if(n>1)
{
return n*n+square(n-1);
}
}*/
//5. Write a recursive function to calculate sum of digits of a given number
/*#include<stdio.h>
int digit(int );
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf("sum of digits of a given number:%d",digit(number));
return 0;
}
int digit(int n)
{
if(n>0)
return n%10 +digit(n/10);
}*/
//6. Write a recursive function to calculate factorial of a given number
/*#include<stdio.h>
int factorial(int);
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf("factorial of number is :%d",factorial(number));
return 0;
}
int factorial(int n)
{
if(n==0)
return 1;
if(n>1)
return n*factorial(n-1);
}*/
//7. Write a recursive function to calculate HCF of two numbers
/*#include<stdio.h>
int hcf(int,int);
int main()
{
int number_1,number_2;
printf("enter number_1:");
scanf("%d",&number_1);
printf("enter number_2:");
scanf("%d",&number_2);
printf("HCF of a two number is a :%d",hcf(number_1,number_2));
}
int hcf(int a, int b)
{
/*if(a==0)
{
return b;
}
return hcf(b%a,a);
if(a==0)
{
return b ;
}
if(a>b)
{
hcf(a%b,b);
}
else{
hcf(b%a,a);
}
}*/
//8. Write a recursive function to print first N terms of Fibonacci series
/*#include<stdio.h>
int fibbo(int);
int main()
{
int number;
printf("enter how many fibbonacci series you want to see");
scanf("%d",&number);
for (int i=1;i<=number;i++)
printf("%d ",fibbo(i));
return 0;
}
int fibbo(int n)
{
if(n==1||n==2)
return 1;
return fibbo(n-1)+fibbo(n-2);
}*/
//9. Write a program in C to count the digits of a given number using recursion.
/*#include<stdio.h>
int digit(int );
int main()
{
int number;
printf("enter number");
scanf("%d",&number);
printf("The digits of a given number :%d",digit(number));
return 0;
}
int c=0;
int digit(int n)
{
if(n)
{
c++;
digit(n/10);
}
return c;
}*/
//10. Write a program in C to calculate the power of any number using recursion
/*/#include<stdio.h>
int power(int,int );
int main()
{
int number,power_no;
printf("enter number");
scanf("%d",&number);
printf("enter number for power");
scanf("%d",&power_no);
printf("power of a given number is a %d",power(number,power_no));
return 0;
}
int power(int b,int p)
{
if(p==0)
{
return 1;
}
return b*power(b,(p-1));
}*/