In the one and only true way. The object-oriented version of 'Spaghetti code' is, of course, 'Lasagna code'. (Too many layers). Roberto Waltman
Selection sort is a sorting algorithm that divide into the sorted and unsorted part. It moves unsorted items to sorted array every step. Selection sort is an in-place comparison sort and faster than bubble sort.
Write a program to implement selection sort.
Unsorted array before sorting: [12, 11, 13, 5, 6, 7] Sorted array after selection sorting: [5, 6, 7, 11, 12, 13]