Insertion Sort using C++

Program Code:

#include<iostream.h>
#include<conio.h>
main()
{
int a[50],size;
char ch;
cout<<"Enter size of array\n";
cin>>size;
cout<<"Enter the order of sorting\n";
cout<<"Enter a for ascending or d for decending\n";
cin>>ch;
cout<<"Enter elements of array\n";
for(int i=0;i<size;i++)
{
cin>>a[i];
}
int t;
for(int i=1;i<=size;i++)
{
t=a[i];
for(int j=0;j<i;j++)
{
if(t<a[j])
{
for(int k=i;k>=j;k--)
{
a[k]=a[k-1];
}
a[j]=t;
break;

}
}
}
cout<<"The sorted array is\n";
if(ch=='a')
{
        for(int i=0;i<size;i++)
        {
cout<<a[i]<<"\t";
}
}
else if(ch=='d')
{
        for(int i=size-1;i>=0;i--)
{
cout<<a[i]<<"\t";
}
}
getch();
}

Output:

Read More

Bubble sort using C++

Program Code:


#include<iostream.h>
#include<conio.h>
main()
{
int a[50],size;
char ch;
cout<<"Enter size of array\n";
cin>>size;
cout<<"Enter the order of sorting\n";
cout<<"Enter a for ascending or d for decending\n";
cin>>ch;
cout<<"Enter elements of array\n";
for(int i=0;i<size;i++)
{
cin>>a[i];
}
for(int i=0;i<size;i++)
{
for(int j=0;j<size-i;j++)
{
if(a[j+1]<a[j])
{
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
cout<<"The sorted array is\n";
if(ch=='a')
{
        for(int i=0;i<size;i++)
        {
cout<<a[i]<<"\t";
}
}
else if(ch=='d')
{
        for(int i=size-1;i>=0;i--)
{
cout<<a[i]<<"\t";
}
}
getch();
}

Output:

Read More

Selection sort using C++

Program Code:

#include<iostream.h>
#include<conio.h>
main()
{
int a[50],size;
char ch;
cout<<"Enter size of array\n";
cin>>size;
cout<<"Enter the order of sorting\n";
cout<<"Enter a for ascending or d for decending\n";
cin>>ch;
cout<<"Enter elements of array\n";
for(int i=0;i<size;i++)
{
cin>>a[i];
}
for(int i=0;i<size-1;i++)
{
for(int j=i+1;j<size;j++)
{
if(a[i]<a[j])
{
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
cout<<"The sorted array is\n";
if(ch=='d')
{
        for(int i=0;i<size;i++)
        {
cout<<a[i];
}
}
else if(ch=='a')
{
        for(int i=size-1;i>=0;i--)
{
cout<<a[i]<<"\t";
}
}
getch();
}

Output:

Read More

Binary Search using C++

Program Code:

#include<iostream.h>
#include<conio.h>
int binarySearch(int a[],int,int);

main()
{
int arr[50],size,index,target;
cout<<"Enter the size of array(max 50):\n";
cin>>size;
cout<<"Enter the elements of the array:\n";
for(int i=0;i<size;i++)
{
cin>>arr[i];
}
cout<<"Enter the element to be searched:\n";
cin>>target;
index=binarySearch(arr,size,target);
if(index==-1)
{
cout<<"Element is not present in the list\n";
}
else
{
cout<<"Element is present at index "<<index+1;
}

getch();
}
int binarySearch(int a[],int s,int t)
{
int beg,last,mid;
beg=0;
last=s-1;
while(beg<=last)
{
mid=(beg+last)/2;
if(a[mid]==t)
{
return mid;
}
else if(t>a[mid])
{
beg=mid+1;
}
else
{
last=mid-1;
}
}
return -1;
}

Output:

Read More

Linear Search using C++

Program Code:


#include<iostream.h>
#include<conio.h>
int linearSearch(int a[],int,int);

main()
{
int arr[50],size,index,target;
cout<<"Enter the size of array(max 50):\n";
cin>>size;
cout<<"Enter the elements of the array:\n";
for(int i=0;i<size;i++)
{
cin>>arr[i];
}
cout<<"Enter the element to be searched:\n";
cin>>target;
index=linearSearch(arr,size,target);
if(index==-1)
{
cout<<"Element is not present in the list\n";
}
else
{
cout<<"Element is present at index "<<index+1;
}

getch();
}
int linearSearch(int a[],int s,int t)
{
for(int i=0;i<s;i++)
{
if(a[i]==t)
{
return i;
}
}
return -1;
}

Output:

Read More