package sorting; public class SelectionSort { public static void main(String[] args) { new SelectionSort(); } public SelectionSort() { int[] arr=new int[]{1,4,3,2,1}; System.out.println("Before Sorting..."); printArray(arr); //sortWay1(arr); sortWay2(arr); System.out.println(); System.out.println("After Sorting..."); printArray(arr); } private void sortWay1(int[] arr) { for (int i = 0; i < arr.length-1; i++) { for (int j = i+1; j < arr.length; j++) { if(arr[i]>arr[j]){ int t = arr[i]; arr[i]=arr[j]; arr[j]=t; } } } } private void sortWay2(int[] arr) { for (int i = 0; i < arr.length-1; i++) { int minPos=i; for (int j = i+1; j < arr.length; j++) { if(arr[i]>arr[j]){ minPos=j; } if(minPos!=i){ int t = arr[i]; arr[i]=arr[j]; arr[j]=t; } } } } private void printArray(int arr[]){ for (int i = 0; i < arr.length; i++) { System.out.print(arr[i] + " "); } } }
Questions on Stack, Queues, Linkedlist, Binary Trees, Sorting, Searching, Graphs etc with solution using Java Language.
Wednesday, 24 December 2014
Selection Sort
Labels:
Sorting
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment