Algorithms: Sorting Tutorials and Code Examples - Page 12

Iterative Quick Sort in Java

Quick sort partitions around a pivot and sorts the two resulting regions.

java

    static int quick_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[] lefts = new int[alg_size(64)];
        int[] rights = new int[alg_size(64)];
        int top = 0;
        int low = 0;
        int high = Math.subtractExact(n, 1);
        int left = 0;
        int right = 0;

Nov 15, 2026 Java

Algorithms: Sorting

Iterative Quick Sort in C

Quick sort partitions around a pivot and sorts the two resulting regions.

c

int quick_sort(int *a, size_t a_length) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    int *lefts = NULL;
    int *rights = NULL;
    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; }

Nov 15, 2026 C

Algorithms: Sorting

Bubble Sort in C#

Bubble sort repeatedly swaps adjacent out-of-order values.

csharp

    static int bubble_sort(Span<int> a) {
        checked {
            int n = a.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((a.Length == n));
            int end = (n - 1);
            int i = 0;
            int swapped = 0;
            int temp = 0;
            while ((end > 0)) {
                swapped = 0;
                i = 0;

Nov 15, 2026 csharp

Algorithms: Sorting

Bubble Sort in C++

Bubble sort repeatedly swaps adjacent out-of-order values.

cpp

int bubble_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 end = alg_sub(n, 1);
    int i = 0;
    int swapped = 0;
    int temp = 0;
    while ((end > 0)) {
        swapped = 0;
        i = 0;

Nov 15, 2026 C++

Algorithms: Sorting

Bubble Sort in C

Bubble sort repeatedly swaps adjacent out-of-order values.

c

int bubble_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 end = alg_sub(n, 1, &alg_error);

Nov 15, 2026 C