Selection sort

Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n - 1 elements of A.This is how selection sort algorithm works, which costs O(n²).#include <iostream>using namespace std;int main(){ int size; //determine the size of the array cout<<"determine the size of array: "; cin>>size; int *array = new int[size]; int i,j,key,n; cout<<"input numbers: "; //input the numbers that will be sorted for(i=0;i<size;i++) cin>>array[i]; cout<<endl; for(i=0;i<size;i++) //sort the array by selection sort algorithm { key=array[i]; n=i; for(j=i;j<size;j++) { if(key>=array[j]) { key=array[j]; n=j; } } swap(array[i],array[n]); } cout<<"sorted array is displayed below: "; //output the sorted array for(i=0;i<size;i++) { cout<<array[i]<<" "; } delete [] array;}