Swift实现八大排序

持续更新中...
环境：Mac+Swift4
GitHub源码：swift-algorithm

import Foundation

class Sort{
    
    //MARK: - 冒泡排序
    //核心是两次遍历，里循环最大往右放，只遍历到len-i-1
    class func bubbleSort(array:[Int])->[Int]{
        var newArray = array
        for i in 0..<newArray.count{
            for j in 0..<newArray.count-(i+1){
                if newArray[j] > newArray[j+1]{
                    let temp = newArray[j]
                    newArray[j] = newArray[j+1]
                    newArray[j+1] = temp
                }
            }
        }
        return newArray
    }
    
    //MARK: - 选择排序
    //核心是两次遍历，里循环找最小复制给array[i]，里面的顺序是i+1到底
    class func selectSort(array:[Int])->[Int]{
        var newArray = array
        let len = array.count
        for i in 0..<len{
            var min = newArray[i]
            for j in (i+1)..<len{
                if min > newArray[j]{
                    let temp = min
                    min = newArray[j]
                    newArray[j] = temp
                }
            }
            newArray[i] = min
        }
        return newArray
    }
}