bubblesort.c

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

#define LENGTH 10

int main(void) {
	int unordered[LENGTH] = {8, 2, 4, 9, 3, 7, 1, 0, 5, 6};
	int swap, i, j;

	for (i=0; i < LENGTH; i++) {
		for (j=0; j < LENGTH - i; j++) {
			if (j+1 == LENGTH)
				break;
			
			if (unordered[j] > unordered[j+1]) {
				swap = unordered[j+1];
				unordered[j+1] = unordered[j];
				unordered[j] = temp;
			}
		}
	}

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

	return EXIT_SUCCESS;
}