Algorithms: Sorting

def bubble_sort(a: list[int]) -> int:
    alg_require(isinstance(a, list) and len(a) <= 1000000)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    end: int = n - 1
    i: int = 0
    swapped: int = 0
    temp: int = 0
    while end > 0:
        swapped = 0
        i = 0

function bubble_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let end = alg_sub(n, 1);
    let i = 0;
    let swapped = 0;
    let temp = 0;
    while ((end > 0)) {
        swapped = 0;
        i = 0;

    static int bubble_sort(int[] a) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        int end = Math.subtractExact(n, 1);
        int i = 0;
        int swapped = 0;
        int temp = 0;
        while ((end > 0)) {
            swapped = 0;
            i = 0;

function selection_sort(array &$a): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    $i = 0;
    $j = 0;
    $best = 0;
    $temp = 0;
    while (($i < $n)) {
        $best = $i;
        $j = alg_add($i, 1);

    static int selection_sort(Span<int> a) {
        checked {
            int n = a.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((a.Length == n));
            int i = 0;
            int j = 0;
            int best = 0;
            int temp = 0;
            while ((i < n)) {
                best = i;
                j = (i + 1);