JavaAlgorithms/Sorts/SelectionSort.java

54 lines
766 B
Java
Raw Normal View History

import java.util.Scanner;
/**
* This class implements Selection Sort
*
* @author Unknown
*
*/
class SelectionSort
{
/**
* Main method
*
* @param args Command line arguments
*/
public static void main(String[] args)
{
int array[]=new int[6];
Scanner input=new Scanner(System.in);
//Input
System.out.println("Enter any 6 Numbers for Unsorted Array : ");
for(int i=0; i<6; i++)
{
array[i]=input.nextInt();
}
//Sorting
for(int i=0; i<6; i++)
{
int min=i;
for(int j=i+1; j<6; j++)
{
if(array[j]<array[min])
{
min=j;
}
}
int temp=array[i];
array[i]=array[min];
array[min]=temp;
}
//Output
for(int i=0; i<6; i++)
{
System.out.print(array[i]+"\t");
}
input.close();
}
}