Insert sort and bubble sort (Swift version)

Insert sort (only record code is not analyzed in detail)

Insert sort inserts the input elements into the sorted queue, and the contrast is the forward

Code:

Func insertsort<elem:comparable> (_ arr:inout [Elem]) {
    for I in 1...arr.count-1 {
&N bsp;       let tmp = Arr[i]
       
         for J in (0...i-1). Reversed () {
             if (J > 0 && arr[j] > tmp) {
                 arr[j + 1] = Arr[j]
            } else {
                 arr[j + 1] = tmp
                 break
           }
        
   }
}

Bubble Sort:

Func bubblesort<elem:comparable> (_ arr:inout [Elem]) {
Func Swap (_ A:inout Elem, _ b:inout Elem) {
Let TMP = a
A = b
b = tmp
}

For I in (1...arr.count-1). Reversed () {
For J in 0...i-1 {
If ARR[J] > arr[j+1] {
Swap (&arr[j], &arr[j+1])
}
}
}
}

Insert sort and bubble sort (Swift version)