Created
November 4, 2009 06:45
-
-
Save Lytol/225870 to your computer and use it in GitHub Desktop.
Selection sort implementation in Scala
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Inmperative version | |
// | |
def selectionSort(list: Array[Int]): Unit { | |
def swap(list: Array[Int], i: Int, j: Int) { | |
var tmp = list(i) | |
list(i) = list(j) | |
list(j) = tmp | |
} | |
var i = 0 | |
while(i < (list.length - 1)) { | |
var min = i | |
var j = i + 1 | |
while (j < list.length) { | |
if(list(j) < list(min)) { | |
min = j | |
} | |
j += 1 | |
} | |
swap(list, i, min) | |
i += 1 | |
} | |
} | |
// Functional / Recursive version | |
// | |
def selectionSort2(list: List[Int]): List[Int] = { | |
if(list.length == 1) list | |
else { | |
// Pseudo code | |
// list.min :: selectionSort2(list.everything_but_min) | |
} | |
} |
shankarshastri
commented
Apr 19, 2018
•
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment