1. PROBLEM STATEMENT:
Sorting the list using selection sort algorithm.
CODING:
#include<iostream.h>
#include<conio.h>
class array
{ private:
int arr[10];
int count;
public:
array();
void add(int item);
void sort();
void display(); };
array::array()
{count=0;
for(int i=0;i<10;i++)
arr[i]=0;}
void array::add(int item)
{ if(count<10)
{ arr[count]=item;
count++;
}else
cout<<"array is full"<<endl;}
void array::sort()
{ int temp;
for(int i=0;i<=count-1;i++)
{ for(int j=i+1;j<=count-1;j++)
{ if(arr[i]>arr[j])
{ temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}}}}
void array::display()
{ for(int i=0;i<count;i++)
cout<<arr[i]<<"t";}
int main()
{ clrscr();
1

2. array a;
int size;
cout<<"nn**************selection sort*******************"<<endl;
cout<<"nnenter array sizen"<<endl;
cin>>size;
cout<<"nenter array elementsn"<<endl;
for(int i=0;i<size;i++)
{int x;
cin>>x;
a.add(x); }
a.sort();
cout<<"nnselection sorted array:"<<endl;
a.display();
getche();
return 0;}
OUTPUT:
2