Beware of bugs in the above code; I have only proved it correct, not tried it. Donald E. Knuth

Selection sort

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 7:48 am


Algorithm Problem Description

Selection sort is sorting algorithm that divide into the sorted and unsorted part. It moves unsorted items to sorted array every step. It is an in-place comparison sort and faster than bubble sort. Write a program to implement selection sort.

Output

          	        
          	        

Unsorted array before sorting: [12, 11, 13, 5, 6, 7]
Sorted array after selection sorting: [5, 6, 7, 11, 12, 13]

          	        
          	        				    


Comments



Please login to add comments.