#include<bits/stdc++.h>
using namespace std;
int minn,temp;
void insertion_sort(int arr[], int n){
for(int i = 0; i < n-1;i++){
minn = i;
for(int j = i+1; j < n; j++){
if(arr[minn]>arr[j]){
minn = j;
}
}
swap(arr[i],arr[minn]);
}
}
int main(){
int arr[]= {1,12,3,5,10};
int n = sizeof(arr)/sizeof(arr[0]);
insertion_sort(arr,n);
for(int i = 0; i < n; i++){
cout<<arr[i]<<" ";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1pbm4sdGVtcDsKdm9pZCBpbnNlcnRpb25fc29ydChpbnQgYXJyW10sIGludCBuKXsKZm9yKGludCBpID0gMDsgaSA8IG4tMTtpKyspewogICAgbWlubiA9IGk7CiAgICBmb3IoaW50IGogPSBpKzE7IGogPCBuOyBqKyspewogICAgICAgIGlmKGFyclttaW5uXT5hcnJbal0pewogICAgICAgICAgICBtaW5uID0gajsKICAgICAgICB9CiAgICB9CiAgICBzd2FwKGFycltpXSxhcnJbbWlubl0pOwp9Cgp9CgppbnQgbWFpbigpewppbnQgYXJyW109IHsxLDEyLDMsNSwxMH07CmludCBuID0gc2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7Cmluc2VydGlvbl9zb3J0KGFycixuKTsKZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CiAgICBjb3V0PDxhcnJbaV08PCIgIjsKfQpyZXR1cm4gMDsKfQo=