Algorithms: Sorting Tutorials and Code Examples - Page 9

Heap Sort in JavaScript

Heap sort uses a max heap so the largest remaining value can be moved to the end.

javascript

function heap_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let start = alg_sub(Math.floor(n / 2), 1);
    let end = alg_sub(n, 1);
    let root = 0;
    let child = 0;
    let temp = 0;
    while ((start >= 0)) {
        root = start;

Nov 15, 2026 javascript

Algorithms: Sorting

Heap Sort in Java

Heap sort uses a max heap so the largest remaining value can be moved to the end.

java

    static int heap_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 start = Math.subtractExact((n / 2), 1);
        int end = Math.subtractExact(n, 1);
        int root = 0;
        int child = 0;
        int temp = 0;
        while ((start >= 0)) {
            root = start;

Nov 15, 2026 Java

Algorithms: Sorting

Counting Sort in PHP

Counting sort counts each possible key instead of comparing pairs.

php

function counting_sort(array &$a, int $maximum): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    alg_require((($maximum >= 0) && ($maximum <= 1000000)));
    for ($alg_i = 0; $alg_i < count($a); $alg_i++) {
        $alg_value = $a[$alg_i];
        alg_require((($alg_value >= 0) && ($alg_value <= $maximum)));
    }
    $counts = array_fill(0, alg_size(alg_add($maximum, 1)), 0);
    $i = 0;

Nov 15, 2026 PHP

Algorithms: Sorting

Counting Sort in C#

Counting sort counts each possible key instead of comparing pairs.

csharp

    static int counting_sort(Span<int> a, int maximum) {
        checked {
            int n = a.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((a.Length == n));
            alg_require(((maximum >= 0) && (maximum <= 1000000)));
            for (int alg_i = 0; alg_i < a.Length; alg_i++) {
                int alg_value = a[alg_i];
                alg_require(((alg_value >= 0) && (alg_value <= maximum)));
            }
            int[] counts = new int[alg_size((maximum + 1))];
            int i = 0;

Nov 15, 2026 csharp

Algorithms: Sorting

Counting Sort in C++

Counting sort counts each possible key instead of comparing pairs.

cpp

int counting_sort(std::vector<int>& a, int maximum) {
    alg_require(a.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    alg_require(((maximum >= 0) && (maximum <= 1000000)));
    for (int alg_i = 0; alg_i < (int)a.size(); alg_i++) {
        int alg_value = a[alg_i];
        alg_require(((alg_value >= 0) && (alg_value <= maximum)));
    }
    std::vector<int> counts(alg_size(alg_add(maximum, 1)), 0);
    int i = 0;

Nov 15, 2026 C++