#include <stdio.h>
#include <stdlib.h>

void swap();
void printArray();
void bubbleSort();

int main(){
	int n;

	printf("Enter number of elements: \n");
	scanf("%d", &n);

	int *inputs;
	inputs = malloc(n * sizeof(*inputs));
	printf("Please enter %d integers: \n", n);

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

	bubbleSort(inputs, n);

	printArray(inputs, n);
}

void bubbleSort(int arr[], int n) {
   int i, j;
   for (i = 0; i < n-1; i++)

       // Last i elements are already in place
       for (j = 0; j < n-i-1; j++)
           if (arr[j] > arr[j+1])
              swap(&arr[j], &arr[j+1]);
}


void swap(int *xp, int *yp) {
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

void printArray(int arr[], int size) {
	printf("Sorted list in ascending order: \n");
    int i;
    for (i=0; i < size; i++)
        printf("%d \n", arr[i]);
}