Name: Muhammad Hassan

Reg no: FA19-BSE-097

Section: BSE-4C

Q1.
#include<iostream>
using namespace std;
void ascending(int arr[10]);
void dscending(int arr[10]);
int main()
{
int arr[10]={55,22,77,1,88,45,23,76,32,97};
int ch;
cout<<"1. Press 1 for Insertion sorting in ascending order ";
cout<<"\n2. Press 2 for Insertion sorting in dscending order:\n";
cin>>ch;
switch(ch)
{
case 1:
{
ascending(arr); break;
}
case 2:
{
dscending(arr); break;
}
defaut:
{
cout<<"\nInvalid Choice";
}
}

}
void ascending(int arr[10])
{
int i,n,k;
for (int j = 1;j<10;j++)
{
k=arr[j];
i=j-1;
while(k<arr[i]&& i>=0)
{
arr[i+1]=arr[i];
i--;
}
 arr[i+1]=k;

}
cout<<"The sorted array in ascending order is : ";
for(n=0;n<10;n++)
{
cout<<arr[n]<<" ";
}
}
void dscending(int arr[10])
{
int i,n,k;
for (int j = 1;j<10;j++)
{
k=arr[j];
i=j-1;
while(k>arr[i]&& i>=0)
{
arr[i+1]=arr[i];
i--;
}
arr[i+1]=k;

}
cout<<"The sorted array in dscending order is : ";
for(n=0;n<10;n++)
{
cout<<arr[n]<<" ";
}

Q2.
#include<iostream>
using namespace std;
void ascending(int arr[5]);
void dscending(int arr[5]);
int main()
{
int arr[5]={3,7,1,8,2};
int ch;
cout<<"1. Press 1 for sorting in ascending order \n2. Press 2 for sorting in
dscending order:\n";
 cin>>ch;
switch(ch)
{
case 1:
{
ascending(arr); break;
}
case 2:
{
dscending(arr); break;
}
defaut:
{
cout<<"\nInvalid Choice";
}
}

}
void ascending(int arr[5])
{
int i = 0,j;
int min = arr[i];
int k;
for(i=0;i<=4;i++)
{
for(j=i+1;j<=4;j++)
{
if(arr[i]>arr[j])
{
min = arr[j];
k=j;
swap(arr[i],arr[j]);
}
}
}
cout<<"Sorted array in ascending order : ";
for(int n=0;n<5;n++)
{
cout<<arr[n]<<" ";
}

}
void dscending(int arr[5])
{
int i = 0,j;
int min = arr[i];
int k;
 for(i=0;i<=4;i++)
{
for(j=i+1;j<=4;j++)
{
if(arr[i]<arr[j])
{
min = arr[j];
k=j;
swap(arr[i],arr[j]);
}
}
}
cout<<"Sorted array in desending order : ";
for(int n=0;n<5;n++)
{
cout<<arr[n]<<" ";
}
}