Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def insertionSort(unsortedList : List[String]) = {
- val F = unsortedList.toArray
- for(i <- (2 until F.length)){
- val m = F(i)
- var j = i;
- while(j > 1 && !sorted){
- if (F(j-1) >= m) {
- F(j) = F(j-1)
- j -= 1
- }
- }
- F(j) = m
- }
- F.toList
- }
- // Note:
- // This algorithm has been transcribed from:
- // Saake and Sattler. "Algorithmen und Datenstrukturen. Eine Einführung in Java".
- // dpunkt.verlag Heidelberg, 2004. page 123f
Add Comment
Please, Sign In to add comment