Minimum number in an array

#include<stdio.h>
#include<conio.h>
int main()
{
int n,*a,i,min;
printf("Enter the limit: ");
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
printf("Enter the element %d:",(i+1));
scanf("%d",&a[i]);
}
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]<min)
min=a[i];
}
printf("\nThe minimum number in the array %d\n",min);
getch();
return 0;
}

Maximum Number in an array

#include<stdio.h>
#include<conio.h>
int main()
{
int n,*a,i,max;
printf("Enter the limit: ");
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
for(i=0;i<5;i++)
{
printf("Enter the element %d:",(i+1));
scanf("%d",&a[i]);
}
max=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
}
printf("\nThe maximum number in the array %d\n",max);
getch();
return 0;
}

Linear Search in C

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
int main()
{
int i,num,f=0,pos=-1,*arr,n;
printf("\n Enter the number of elements ");
scanf("%d",&n);
arr=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
  printf("\n Enter element %d :",i);
  scanf("%d",(arr+i));
}
printf("\n Enter the element to be searched ");
scanf("%d",&num);
for(i=0;i<n;i++)
{
  if(*(arr+i)==num)
  {
  f=1;
  pos=i;
  break;
  }
}
if(f==1)
printf("\n %d is found at the position %d. ",num,pos);
if(f==0)
printf("\n The searched number %d does not exist in the array. ",num);
getch();
return 0;
}

Insertion Sort in C

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
int main()
{
int j,i,n,*arr,temp;
printf("\n Enter the number of elements ");
scanf("%d",&n);
arr=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
 printf("\n Enter the element %d ",i);
 scanf("%d",&arr[i]);
}
for(i=1;i<n;i++)
{
temp=arr[i];
j=i-1;
while(temp<arr[j] && j>=0)
{
arr[j+1]=arr[j];
j--;
}
arr[j+1]=temp;
}
printf("\n Sorted array is...... ");
for(i=0;i<n;i++)
printf("\t %d ",arr[i]);
getch();
return 0;
}

Binary Search in C

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
main()
{
int c=0,f=0,i,num,beg,*arr,n,end;
printf("\n Enter the number of elements ");
scanf("%d",&n);
arr=(int*)malloc(n*2);
for(i=0;i<n;i++)
{
  printf("\n Enter element %d :",i);
  scanf("%d",(arr+i));
}
printf("\n Enter the element to be searched ");
scanf("%d",&num);
beg=0,end=n-1;
while(beg<=end)
{
int mid=(beg+end)/2;
if(*(arr+mid)==num)
{
c++;
printf("\n %d is present in the array at the position = %d ",num,mid);
f=1;
break;
}
else if(*(arr+mid)>num)
end=mid-1;
else
beg=mid+1;
c++;
}
if(beg>end && f==0)
printf("\n %d does not exist in the array ",num);
getch();
}

Bubble sort in C

/*Program to sort a given array using bubble sort*/

#include<malloc.h>
#include<stdio.h>
#include<conio.h>
main()
{
int j,i,n,*arr,temp;
printf("\n Enter the number of elements ");
scanf("%d",&n);
arr=(int*)malloc(n*2);
for(i=0;i<n;i++)
{
 printf("\n Enter the element %d ",i);
 scanf("%d",(arr+i));
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(*(arr+j)>*(arr+j+1))
{
temp=*(arr+j);
*(arr+j)=*(arr+j+1);
arr[j+1]=temp;
}
}
}
printf("\n The sorted array is: ");
for(i=0;i<n;i++)
printf("\t %d ",*(arr+i));
getch();
}

Inserting an element at a specific position

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
main()
{
int i,n,num,pos,*arr;
printf("\n Enter number of elements ");
scanf("%d",&n);
arr=(int*)malloc(n*2);
for(i=0;i<n;i++)
{
printf("\n Enter element ",i);
scanf("%d",(arr+i));
}
printf("\n Enter number to be inserted... ");
scanf("%d",&num);
printf("\n Enter the position of the element to be inserted ");
scanf("%d",&pos);
for(i=n-1;i>=pos;i--)
*(arr+(i+1))=*(arr+i);
*(arr+pos)=num;
n++;
printf("\n Array after insertion....");
for(i=0;i<n;i++)
printf("\t %d ",*(arr+i));
getch();
}

Checking a duplicate number in an array

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
main()
{
int n,*arr,j,i,f=0;
printf("\n Enter the size of the array ");
scanf("%d",&n);
arr=(int*)malloc(n*2);
for(i=0;i<n;i++)
{
printf("\n Enter the element: %d ",i);
scanf("%d",(arr+i));
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(*(arr+i)==*(arr+j) && i!=j)
{
f=1;
printf("\n Duplicate number found at position %d and %d. ",i,j);
}
}
}
if(f==0)
printf("\n No duplicate number found..... ");
getch();
}