Sort an Array in Descending Order

Code

#include <stdio.h>
#include <stdint.h>

void swap(uint8_t *arr, uint8_t index1, uint8_t index2){

    arr[index1] ^= arr[index2];
    arr[index2] ^= arr[index1];
    arr[index1] ^= arr[index2];
    return;
}

void bubble_sort_desc(uint8_t *arr, uint8_t n) {

    if(n <= 1){
        return;
    }
    
    uint8_t error_found = 1;
    while(error_found){
        error_found = 0;

        int main = 0;
        int second = 1;

        while(main < n && second < n){
            if(arr[main] < arr[second]){
                swap(arr, main, second);
                error_found = 1;
                break;
            }else{
                main++;
                second++;
            }
        }

    }



}

int main() {
    uint8_t n;
    scanf("%hhu", &n);
    uint8_t arr[100];

    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }

    bubble_sort_desc(arr, n);

    for (uint8_t i = 0; i < n; i++) {
        printf("%hhu", arr[i]);
        if(i < n-1){
            printf(" ");
        }
    }

    return 0;
}

Solving Approach

 

 

 

Upvote
Downvote
Loading...

Input

5 10 3 5 2 7

Expected Output

10 7 5 3 2