4.Selection Sort Algorithm

package sorting;

public class selection {
	static void selectionSort(int arr[]) {
		int n=arr.length;
		//finding the smallest element
		for(int i=0;i<n-1;i++) {
			 // Find the minimum element in unsorted array
            int min = i;
            for (int j = i+1; j < n; j++) {
                if (arr[j] < arr[min])
                    min = j;}
 
            // Swap the found minimum element with the first element
            int temp = arr[min];
            arr[min] = arr[i];
            arr[i] = temp;
		}
	}
	
	static void printArray(int arr[]) {
		int n = arr.length;
        for (int i=0; i<n; ++i)
            System.out.print(arr[i]+" ");
        System.out.println();
		 
	 }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[]= {8,1,5,7,2,-7};
		selectionSort(arr);
		System.out.println("the sorted one is:");
		printArray(arr);
	}

}