Selection sort

Program:

 #include<stdio.h>
int main()
{
int a[100],i,j,temp,n,k;
printf("Enter no. of elements: \n");
scanf("%d",&n);
printf("Enter array elements: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
k=i;
for(j=i;j<n;j++)
{
if(a[k]>a[j])
{
k=j;
}
}
if(k!=i)
{
temp=a[k];
a[k]=a[i];
a[i]=temp;
}
}
printf("Sorted elements...\n");
for(i=0;i<n;i++)
{
printf("%d\t",a[i]);
}
return 0;

}

Output:

Labels: ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

x^y using recursion

Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...

  • 1² + 2² +3² +.............+ n²
    // 1² + 2² +3² +.............+ n² Program: #include<stdio.h> int main() { int n,i,sum=0; printf("Enter n: "); sc...
  • Convert into upper string
    Program: #include<stdio.h> int main() { char s1[30],s2[30]; int i=0; printf("Enter a string: "); scanf("%s...
  • Number Pattern : 29
    Program: #include <stdio.h> int main() {     int i,j,n; printf("How many lines: "); scanf("%d",&n); ...