Hint: In line 12 we use ternary operator. crr[k++]=arr[i]<brr[j]?arr[i++]:brr[j++]; . This line means if arr[i]<brr[j] is true then this arr[i++] value assign to array crr[k++] and both arr[] and crr[] array increased by 1.If crr[k++]=arr[i]<brr[j] false then this brr[j++] value assign to crr[k++] and both brr[] and crr[] array increased by 1.

Line 16 and 20 means if any value of arr[] or brr[] still can't assigned to crr[] then it will be assigned.

#include<stdio.h>
#include<stdlib.h>
int main()
{
int **a,i,j,r,c;
printf("Enter the size of row and coloumn\n");
scanf("%d%d",&r,&c);
a=(int**)malloc(r*sizeof(int));
for(i=0;i<c;i++)
{
a[i]=(int*)malloc(c*sizeof(int));
}
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("Enter elemens the position of %d%d\n",i,j);
scanf("%d",&a[i][j]);
}
}
printf("the result is-->\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%4d",a[i][j]);
}
printf("\n");
}
return 0;

}

Input::

Enter the size of row and coloumn
3
3
Enter elemens the position of 00
1
Enter elemens the position of 01
2
Enter elemens the position of 02
3
Enter elemens the position of 10
4
Enter elemens the position of 11
5
Enter elemens the position of 12
6
Enter elemens the position of 20
7
Enter elemens the position of 21
8
Enter elemens the position of 22

9

Output::

the result is-->
   1   2   3
   4   5   6
   7   8   9

#include<stdio.h>
#include<stdlib.h>
void insertion(int *a,int n);
int main()
{
int *a,i=0,n,temp;
printf("Enter the size of array\n");
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int));
printf("Enter the elements of array\n");
for(i=0;i<n;i++)
{
/* fflush(stdin);
printf("\n Enter %d th element-->",i);   */
scanf("%d\n",&a[i]);
}
insertion(a,n);
printf("The sorted array is-->\n");
for(i=0;i<n;i++)
{
printf("-->%d\n",a[i]);
}
return 0;
}
void insertion(int *a,int n)
{
int i,j,temp;
for(i=1;i<n;i++)
{
temp=a[i];
j=i-1;
while(j>=0&&temp<a[j])
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=temp;
}
}

Hence: //coming soon

Input::

Enter the size of array
5
Enter the elements of array
5
4
3
2

1

Output::

The sorted array is-->
-->1
-->2
-->3
-->4
-->5

#include<stdio.h>
#include<stdlib.h>
void sorting(int *a,int size)
{
int i,j,temp;
for(i=0;i<=size-1;i++)
{
for(j=0;j<=size-i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
int b_search(int *a,int beg,int end,int k)
{
int mid;
if(beg>end)
{
return (-1);
}
mid=(beg+end)/2;
if(k==a[mid])
{
return mid;
}
else if(k<a[mid])
{
return b_search(a,beg,mid-1,k);
}
else
{
return b_search(a,end,mid+1,k);
}
}
int main()
{
int *a,size,beg,end,l,sid,k;
printf("Enter the size of the array\n");
scanf("%d",&size);
a=(int*)malloc(size*sizeof(int));
printf("Enter the elements\n");
for(l=0;l<size;l++)
{
scanf("%d",&a[l]);
}
sorting(a,size);
printf("The sorted elements are\n");
for(l=0;l<size;l++)
{
printf("%d\n",a[l]);
}
printf("Entr the search number\n");
scanf("%d",&k);
beg=0;
end=size-1;
sid=b_search(a,beg,end,k);
if(sid!=-1)
{
printf("The search number is found\n");
}
else
{
printf("The search number is not found\n");
}
return 0;

}

Hence , //comming soon

Input:

Enter the size of the array
5
Enter the elements
5
4
3
2
1
The sorted elements are
1
2
3
4
5
Entr the search number

6

Output:

The search number is not found