109. Sort an Array in Ascending Order

Back To All Submissions
Previous Submission
Next Submission

Code

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

int findmin(uint8_t *arr,uint8_t n){
    int min=arr[0];
    int index=0;
    for(int i=0;i<n;i++){
        if(arr[i]<min){
            index=i;
            min=arr[i];
        }
    }
    return index;
}

void swap(uint8_t *arr,int start,int index){
    int temp=arr[start];
     arr[start]=arr[index];
     arr[index]=temp;

}
void bubble_sort(uint8_t *arr, uint8_t n) {
    // Your logic here
    for(int i=0;i<n;i++){
        swap(arr,i,i+findmin(arr+i,n-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

 

 

 

Was this helpful?
Upvote
Downvote