Question

How to implement the bubble sort algorithm in Swift

Answer 1

import Foundation

func bubbleSort(_ arr: inout [Int]) {
    var size = arr.count
    var swapped = true

    while swapped {
        swapped = false
        for i in 1..<size {
            if arr[i - 1] > arr[i] {
                arr.swapAt(i - 1, i)
                swapped = true
            }
        }
        size -= 1
    }
}

var arr = [3, 14, 4, 1, 5, 90, 2, 6, 89, 7]

bubbleSort(&arr)

print("Sorted array: \(arr)")



/*
run:

Sorted array: [1, 2, 3, 4, 5, 6, 7, 14, 89, 90]

*/

 

70+ SQL courses for beginners and professionals