package ds.interview.dataStructure.Algo;
import java.util.Arrays;
//Selection Sort : Select min. value and swap with first element
//In Every Lap Smallest element comes at first
public class SelectionSort {
public static void main(String[] args)
{
int min,temp;
int arr[] = {5,8,2,9,1,4,3,7};
for(int i =0;i<arr.length;i++)
{
min = i;
for(int j = i+1;j<arr.length;j++)
{
if(arr[j]<arr[min])
{
min = j;
}
}
temp = arr[i];
arr[i] = arr[min];
arr[min]= temp;
}
System.out.println(Arrays.toString(arr));
}
}
import java.util.Arrays;
//Selection Sort : Select min. value and swap with first element
//In Every Lap Smallest element comes at first
public class SelectionSort {
public static void main(String[] args)
{
int min,temp;
int arr[] = {5,8,2,9,1,4,3,7};
for(int i =0;i<arr.length;i++)
{
min = i;
for(int j = i+1;j<arr.length;j++)
{
if(arr[j]<arr[min])
{
min = j;
}
}
temp = arr[i];
arr[i] = arr[min];
arr[min]= temp;
}
System.out.println(Arrays.toString(arr));
}
}
No comments:
Post a Comment