Find the Biggest Number in an Array of Numbers using Recursion
#include
#include
int large(int[], int, int);
int main()
{
int size;
int largest;
int list[20];
int i;
clrscr();
printf("Enter size of the list:");
scanf("%d", &size);
printf("Printing the list:\n");
for (i = 0; i < size ; i++)
{
list[i] = rand() % size;
printf("%d\t", list[i]);
}
if (size == 0)
{
printf("Empty list\n");
}
else
{
largest = list[0];
largest = large(list, size - 1, largest);
printf("\nThe largest number in the list is: %d\n", largest);
}
}
int large(int list[], int size, int largest)
{
if (size == 1)
return largest;
if (size > -1)
{
if (list[size] > largest)
{
largest = list[size];
}
return(largest = large(list, size - 1, largest));
}
else
{
return largest;
}
getch();
}
Output
Enter size of the list:8
Printing the list:
7 6 1 3 1 7 2 4
The largest number in the list is: 7
Compute the Sum of two One Dimensional Arrays using Malloc
#include
#include
#include
#include
void main()
{
int i, n;
int *a, *b, *c;
clrscr();
printf("How many Elements in each array...\n");
scanf("%d", &n);
a = (int *)malloc(n * sizeof(int));
b = (int *)malloc(n * sizeof(int));
c = (int *)malloc(n * sizeof(int));
printf("Enter Elements of First List\n");
for (i = 0; i < n; i++)
{
scanf("%d", a + i);
}
printf("Enter Elements of Second List\n");
for (i = 0; i < n; i++)
{
scanf("%d", b + i);
}
for (i = 0; i < n; i++)
{
*(c + i) = *(a + i) + *(b + i);
}
printf("Resultant List is\n");
for (i = 0; i < n; i++)
{
printf("%d\n", *(c + i));
}
getch();
}
Output
How many Elements in each array...
5
Enter Elements of First List
23
45
67
12
90
Enter Elements of Second List
87
56
90
45
10
Resultant List is
110
101
157
57
100
No comments:
Post a Comment