Sort an Array in Ascending Order

Code

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

void bubble_sort(uint8_t *arr, uint8_t n) {
  
  uint8_t max = 0;
  uint8_t temp[n] = {0};
  uint8_t array_size = n;
  uint8_t *p = arr;
  
  while(array_size--){
    
    for(uint8_t i = 0; i < n ; i++){
      if(arr[i] == 0){
        continue;  
      }
      
      if((max < arr[i])){
        max = arr[i];
        p = &arr[i];
      }  
    }
    
    temp[array_size] = max;
    *p = 0;
    max = 0;
    
  }
  
  for(int i = 0; i < n; i++){
    arr[i] = temp[i];  
  }
}

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(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

2 3 5 7 10