The Selection Sort Algorithm In this laboratory exercise you
Solution
Hope this helps....
/* package whatever; // don\'t place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be \"Main\" only if the class is public. */
class Sorter
{
public static void selectionSort(int []list)
{
System.out.print(\"Initial Data \");
System.out.println(Arrays.toString(list));
int i,j,temp,minindex;
System.out.println();
int totcomp=0,totswap=0;
for(i=0;i<list.length-1;i++)
{
minindex=i;
int compa=1,swapp=0;
compa++;
// compa++;
System.out.println(Arrays.toString(list));
for(j=i+1;j<list.length;j++)
{
compa++;
compa++;
if(list[j]<list[minindex])
{
//compa++;
minindex=j;
}
}
if(list[i]!=list[minindex])
{
swapp++;
compa++;
temp=list[i];
list[i]=list[minindex];
list[minindex]=temp;
}
totswap+=swapp;
totcomp+=compa;
System.out.println(\"# of comparisions: \"+compa+\",swaps: \"+swapp);
System.out.println();
}
System.out.println(\"Total # of comparisions: \"+totcomp+\",swaps: \"+totswap);
}
}
class SelectionSortDemo
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
int a[]=new int[] {2,4,5,6,4,5,3,5,3};
// int b[];
Sorter s=new Sorter();
s.selectionSort(a);
System.out.println(Arrays.toString(a));
}
}

