The Selection Sort is a popular quadratic sorting algorithm, which has been discussed in detail, with examples and C code over here : Arrays and Sorting: Selection Sort ( with C Program source code). In this tutorial, we will take a quick look at the ruby implementation of Selection Sort.
# Selection Sort ************************* # Selection Sort -> A popular quadratic sorting algorithm with O(n^2) complexity # For Index [i] -> swap the i-th smallest element from (array[i]....array[length-1]) with array[i-1] def selectionSort(arr) for index in0..(arr.length-1) temp = arr[index] min = temp indexToSwap = index for selectedIndex in(index+1)..(arr.length-1) if arr[selectedIndex]< min min = arr[selectedIndex] indexToSwap = selectedIndex end end arr[indexToSwap] = temp arr[index] = min end end
original_array=[2,19,5,4,3,14,2] puts"Sorted Array Using Selection Sort:" selectionSort(original_array) p original_array