2015년 1월 11일 일요일

[Swift] 정렬 알고리즘

func sort(arr:Int...) -> (Array<Int>){
    var newArr = [Int]()
    for oldValue in arr{
        var breakOrder = 0
        for newValue in newArr{
            if(oldValue < newValue){
                break;
            }
            breakOrder++
        }
        newArr.insert(oldValue,atIndex:breakOrder)
    }
    return newArr;
}
var vals = sort(3,4,5,2,1,8,9,4,55,32,3,0,55,3,-8,10,100)

println(vals)


RESULT 
[-8, 0, 1, 2, 3, 3, 3, 4, 4, 5, 8, 9, 10, 32, 55, 55, 100]