Write a program that uses selection sorting to sort an array in ascending order.

#include <iostream>

using namespace std;
int main()
{
int arr[10];
const int size=10;
int i,j,temp=0;
int mainvalue=0,mainindex=0;

cout << “enter an array of 10 numbers :\n”;

for(i=0;i<10;i++)
{
cout <<“enter [“<<i+1<<“] number :”;
cin >> arr[i];
cout <<endl;
}
cout <<“array is:\n”;
for(i=0;i<size;i++)
{
cout <<arr[i] <<“,”;
}
cout <<“\b\b”<<endl;
//selection sorting selects smallest or largest element in whole array and then swaps it
cout <<“slection sorting ascending order:\n”;

for(i=0;i<(size-1);i++)
{
mainvalue=arr[i];
mainindex=i;
for(j=i+1;j<size;j++)
{
if(mainvalue>arr[j])
{

temp++; //temp variable counts maximum numbers of iteration
mainvalue=arr[j]; //selection smallest or largest value
mainindex=j; //selection smallest or largest index
}
}

arr[mainindex]=arr[i]; //swaping
arr[i]=mainvalue;
}
for(i=0;i<size;i++)
{
cout <<arr[i] <<“,”;
}
cout <<“\b\b”<<endl;
cout <<“total numbers of iterations =”<< temp<<endl;

return 0;
}