How do you write a program to sort an array using selection sort?

Answer 1

#include<stdio.h>

#include<conio.h>

void main()

{

clrscr();

int n,i,j,temp,a[50];

printf("Enter how many elements=");

scanf("%d",&n);

printf("Enter %d elements",n);

for(i=1;i<=n;i++)

{

scanf("%d",&a[i]);

}

for(i=1;i<=n-1;i++)

{

for(j=1;j<=n-1;j++)

{

if(a[j]>a[j+1])

{

temp=a[j];

a[j]=a[j+1];

a[j+1]=temp;

}

}

}

printf("\nSorted Array:\n");

for(i=1;i<=n;i++)

{

printf("\n%d",a[i]);

}

getch();

}

Answer 2

class bubble

{

public void main(int a[])

{

int t,l,i,j;

l=a.length;

System.out.println("the original array ");

for (i=0;i<l;i++)

{

System.out.print(a[i] +",");

}

for (i=0;i<l-1;i++)

{

for (j=0;j<l-1;j++)

{

if(a[j]>a[j+1])

{

t=a[j];

a[j]=a[j+1];

a[j+1]=t;

}

System.out.println("the sorted array is ");

for(i=0;i<l;i++)

{

system.out.print(a[i] +",");

}}

Answer 3

Search the unsorted array for the largest element and swap with the last element. Reduce the upper bound of the array by one element, thus creating a sorted array at the end of the array. Repeat until there is only one element in the unsorted array (the smallest element), at which point the array is sorted.