1.int i = 0;
for(i = 0;i < n;i++)
{
if (array[i]==search) {
printf("%d is present at location %d.\n",search,i+1);
count++;
}
}
if (count==0) {
printf("%d is not present in the array.\n",search);
}
else
{
printf("%d is present %d times in the array.\n",search,count);
}
}
2.c=0;
for(position = 0;position< n;position++)
{
if(array[position]==search)
{
printf("%d is present at location %d.\n", search, position+1);
c++;
}
}
if(c==0)
{
printf("%d is not present in the array.\n", search);
}
}
3.int first=0,last=0,middle=0;
middle=(first+last)/2;
last=n-1;
while(first<=last)
{
if(array[middle]<search)
first=middle+1;
else if(array[middle]==search)
{
printf("%d found at location %d.\n", search, middle+1);
break;
}
else
last=middle-1;
middle=(first+last)/2;
}
if(first>last)
printf("Not found! %d isn't present in the list.\n", search);
return 0;
}
4.int b[100], temp, i=0, bk=0;
bk=n-1;
while(bk>=0)
{
b[i]=array[bk];
i++;
bk--;
}
for (c = 0; c < n; c++){
temp=array[c];
array[c]=b[c];
b[c]=temp;
}
5.void merge(int a[], int m, int b[], int n, int sorted[]) {
int i, j, k;
j = k = 0;
for (i = 0; i < m + n;) {
if (j < m && k < n) {
if (a[j] < b[k]) {
sorted[i] = a[j];
j++;
}
else {
sorted[i] = b[k];
k++;
}
i++;
}
else if (j == m) {
for (; i < m + n;) {
sorted[i] = b[k];
k++;
i++;
}
}
else {
for (; i < m + n;) {
sorted[i] = a[j];
j++;
i++;
}
}
}
}
*//CLICK HERE TO VISIT OUR YOUTUBE CHANNEL FOR MORE ASSIGNMENTS OF C PROGRAMMING//*
