Sorting Array

#include <stdio.h>
// Sorting Pseudo algo:
    // 1.given array
    // 2.first pickup the 0 index element and compare it with others using two nested for loops and an if statment.
    // 3.swapping it with that element whose condition-> true-> myarr[i]>myarr[j].
void swap(int* x, int* y){
    int temp=*x;
    *x=*y;
    *y=temp;
}
void printarray(int* A, int n){
    for (int i = 0; i < n; i++){
        printf("%d ", A[i]);
    }
    printf("\n");
}
void askarray(int* A, int n){
    printf("");
    for(int i=0;i<n;i++){
        scanf("%d",&A[i]);
    }
}
void sort(int* A, int n){
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(A[i]>A[j]){
                swap(&A[i],&A[j]);
            }
        }
    }
}
int main(){
    int n;
    printf("Enter size ");
    scanf("%d",&n);
    
    int myarr[n];
    askarray(myarr,n);

    printf("Before sorting:\n");
    printarray(myarr,n);

    sort(myarr,n);

    printf("After sorting:\n");
    printarray(myarr,n);
    // minimum sum,minimum sum
    int sum=0;
    for(int i=0;i<4;i++){
        sum+=myarr[i];
    }
    printf("The min sum is %d ",sum);
    int sumb=0;
    for(int i=4;i>=1;i--){
        sumb+=myarr[i];
    }
    printf("The max sum is %d ",sumb);
    return 0;

}
// NOTE: While Swapping & declaring an array above main() we must have to use *.