Sorting arrays in N-1 time. C(Language) (Not my code)

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <time.h>
#define N 100

int main(){
    int i, j, n, temp;
    int a[N];

    printf("How many members will the array have?\n");
    scanf(" %d", &n);

    printf("Enter the array: \n");

    for(i=0;i<n;i++){
        scanf("%d", &a[i]);
    }

    printf("\nOriginal List\n");

    for(i=0;i<n;i++){
        printf("%d \n", a[i]);
    }

    for(i=0;i<n-1;i++){
        for(j=0; j<n-1; j++){
            if(a[j]>a[j+1]){
                temp = a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
                }
            }
    }


    printf("\nSorted List\n");
    for(i=0;i<n;i++){
        printf("%d \n", a[i]);
    }

    return 0;
}