Example: Bubble Sort in Descending Order in C

// Bubble Sort in Descending Order
#include <stdio.h>

void bubbleSortDescending(int arr[], int n) {
    int i, j, temp;
    // Outer loop for passes (n-1 passes)
    for (i = 0; i < n - 1; i++) {
        // Inner loop for comparisons in each pass
        // The last i elements are already in place
        for (j = 0; j < n - i - 1; j++) {
            // Compare adjacent elements
            // For descending order, if current is smaller than next, swap them
            // to move the larger element towards the left (beginning)
            if (arr[j] < arr[j+1]) {
                // Swap arr[j] and arr[j+1]
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}

// Function to print an array
void printArray(int arr[], int size) {
    int i;
    for (i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main() {
    // Step 1: Initialize an array
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);

    // Step 2: Print original array
    printf("Original array: ");
    printArray(arr, n);

    // Step 3: Call bubble sort function to sort in descending order
    bubbleSortDescending(arr, n);

    // Step 4: Print sorted array
    printf("Sorted array (Descending): ");
    printArray(arr, n);

    return 0;
}