Selection Sort

[phelgo]

Assignment 1 - Selection Sort

[phelgo]

I opted for a inner loop here, but maybe extracting this indexOfMinimumValue logic into a local function can be easier to follow.

[gmertk]

Thanks @phelgo! This could be nice:

func indexOfMinFrom(index: Int, array: [Int]) -> Int? {
    guard 0..<array.count ~= index else {
        return nil
    }

    var indexOfMin = index

    for i in index+1..<array.count where array[i] < array[indexOfMin] {
        indexOfMin = i
    }

    return indexOfMin
}

[phelgo]

@gmertk Exactly 👍
Then the body of the algorithm can be as simple to follow as

for index in array.indices {
    if let indexOfMinimumValue = indexOfMinFrom(index, array) where indexOfMinimumValue != index {
        swap(&array[index], &array[indexOfMinimumValue])
}
return array