Algorithms: Sorting

function shell_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let gap = Math.floor(n / 2);
    let i = 0;
    let j = 0;
    let key = 0;
    while ((gap > 0)) {
        i = gap;
        while ((i < n)) {

def shell_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)
    gap: int = n // 2
    i: int = 0
    j: int = 0
    key: int = 0
    while gap > 0:
        i = gap
        while i < n:

function selection_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let i = 0;
    let j = 0;
    let best = 0;
    let temp = 0;
    while ((i < n)) {
        best = i;
        j = alg_add(i, 1);

int shell_sort(int *a, size_t a_length) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (a_length > 1000000 || (a_length && !a)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = (int)a_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)a_length == n))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int gap = (n / 2);

int shell_sort(std::vector<int>& a) {
    alg_require(a.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    int gap = (n / 2);
    int i = 0;
    int j = 0;
    int key = 0;
    while ((gap > 0)) {
        i = gap;
        while ((i < n)) {