#include<stdio.h>
#include<time.h>
#include<stdlib.h>
clock_t start,end;
double cpu_time_used;
int a[1000000];
void swap(int*a,int*b)
{
int temp=*a;
*a=*b;
*b=temp;
}
void SelectSort(int a[],int n)
{
int i,j,min;
for(i=0;i<n;i++)
{
min=i;
for(i=0;i<n;i++)
{
if(a[j]<a[min])
min=j;
}
swap(&a[min],&a[i]);
}
}
void PrintArray(int a[],int n)
{
int i;
for(i=0;i<n;i++)
}
int main()
{
int i=0,n=0;
printf("\n enter no of elements in array\n"); for(i=0;i<n;i++)
{
a
[i
]=rand()%(100000-10000+1)+1000; }
for(i=0;i<n;i++)
{
}
int size=sizeof (a)/sizeof(a[0]);
SelectSort(a,n);
printf("\nsorted array in ascending order\n"); PrintArray(a,n);
cpu_time_used=((double) (end-start))/CLOCKS_PER_SEC;
printf("\n cpu_time_used= %f \n", cpu_time_used
*1000); return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8dGltZS5oPgojaW5jbHVkZTxzdGRsaWIuaD4KY2xvY2tfdCBzdGFydCxlbmQ7CmRvdWJsZSBjcHVfdGltZV91c2VkOwppbnQgYVsxMDAwMDAwXTsKCnZvaWQgc3dhcChpbnQqYSxpbnQqYikKewoJaW50IHRlbXA9KmE7CgkqYT0qYjsKCSpiPXRlbXA7Cn0Kdm9pZCBTZWxlY3RTb3J0KGludCBhW10saW50IG4pCnsKCWludCBpLGosbWluOwoJZm9yKGk9MDtpPG47aSsrKQoJewoJbWluPWk7Cglmb3IoaT0wO2k8bjtpKyspCgl7CgkJaWYoYVtqXTxhW21pbl0pCgkJbWluPWo7Cgl9Cglzd2FwKCZhW21pbl0sJmFbaV0pOwoJfQp9CnZvaWQgUHJpbnRBcnJheShpbnQgYVtdLGludCBuKQp7CglpbnQgaTsKCWZvcihpPTA7aTxuO2krKykKCXByaW50ZigiXG4gJWQgXHQiLGFbaV0pOwoJcHJpbnRmKCJcbiIpOwp9CmludCBtYWluKCkKewoJaW50IGk9MCxuPTA7CglwcmludGYoIlxuIGVudGVyIG5vIG9mIGVsZW1lbnRzIGluIGFycmF5XG4iKTsKCXNjYW5mKCJcbiAlZCAiLCZuKTsKCWZvcihpPTA7aTxuO2krKykKCXsKCWFbaV09cmFuZCgpJSgxMDAwMDAtMTAwMDArMSkrMTAwMDsKCX0KCWZvcihpPTA7aTxuO2krKykKCXsKCXByaW50ZigiXG4gJWQgXHQiLGFbaV0pOwoJfQoJaW50IHNpemU9c2l6ZW9mIChhKS9zaXplb2YoYVswXSk7CglzdGFydD1jbG9jaygpOwoJU2VsZWN0U29ydChhLG4pOwoJZW5kPWNsb2NrKCk7CglwcmludGYoIlxuc29ydGVkIGFycmF5IGluIGFzY2VuZGluZyBvcmRlclxuIik7CglQcmludEFycmF5KGEsbik7CgljcHVfdGltZV91c2VkPSgoZG91YmxlKSAoZW5kLXN0YXJ0KSkvQ0xPQ0tTX1BFUl9TRUM7CglwcmludGYoIlxuIGNwdV90aW1lX3VzZWQ9ICVmIFxuIiwgY3B1X3RpbWVfdXNlZCoxMDAwKTsKCXJldHVybiAwOwp9