// C program for implementation of Bubble sort
#include <stdio.h>
 
// Swap function
void swap(int* arr, int i, int j)
{
	int temp = arr[i];
	arr[i] = arr[j];
	arr[j] = temp;
}
 
// A function to implement bubble sort
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, j + 1);
}
 
// Function to print an array
void printArray(int arr[], int size)
{
	int i;
	for (i = 0; i < size; i++)
		printf("%d ", arr[i]);
	printf("\n");
}
 
// Driver code
int main()
{
	int arr[] = { 5, 1, 4, 2, 8 };
	int N = sizeof(arr) / sizeof(arr[0]);
	bubbleSort(arr, N);
	printf("Sorted array: ");
	printArray(arr, N);
	return 0;
}
 

Ly8gQyBwcm9ncmFtIGZvciBpbXBsZW1lbnRhdGlvbiBvZiBCdWJibGUgc29ydAojaW5jbHVkZSA8c3RkaW8uaD4KCi8vIFN3YXAgZnVuY3Rpb24Kdm9pZCBzd2FwKGludCogYXJyLCBpbnQgaSwgaW50IGopCnsKCWludCB0ZW1wID0gYXJyW2ldOwoJYXJyW2ldID0gYXJyW2pdOwoJYXJyW2pdID0gdGVtcDsKfQoKLy8gQSBmdW5jdGlvbiB0byBpbXBsZW1lbnQgYnViYmxlIHNvcnQKdm9pZCBidWJibGVTb3J0KGludCBhcnJbXSwgaW50IG4pCnsKCWludCBpLCBqOwoJZm9yIChpID0gMDsgaSA8IG4gLSAxOyBpKyspCgoJCS8vIExhc3QgaSBlbGVtZW50cyBhcmUgYWxyZWFkeQoJCS8vIGluIHBsYWNlCgkJZm9yIChqID0gMDsgaiA8IG4gLSBpIC0gMTsgaisrKQoJCQlpZiAoYXJyW2pdID4gYXJyW2ogKyAxXSkKCQkJCXN3YXAoYXJyLCBqLCBqICsgMSk7Cn0KCi8vIEZ1bmN0aW9uIHRvIHByaW50IGFuIGFycmF5CnZvaWQgcHJpbnRBcnJheShpbnQgYXJyW10sIGludCBzaXplKQp7CglpbnQgaTsKCWZvciAoaSA9IDA7IGkgPCBzaXplOyBpKyspCgkJcHJpbnRmKCIlZCAiLCBhcnJbaV0pOwoJcHJpbnRmKCJcbiIpOwp9CgovLyBEcml2ZXIgY29kZQppbnQgbWFpbigpCnsKCWludCBhcnJbXSA9IHsgNSwgMSwgNCwgMiwgOCB9OwoJaW50IE4gPSBzaXplb2YoYXJyKSAvIHNpemVvZihhcnJbMF0pOwoJYnViYmxlU29ydChhcnIsIE4pOwoJcHJpbnRmKCJTb3J0ZWQgYXJyYXk6ICIpOwoJcHJpbnRBcnJheShhcnIsIE4pOwoJcmV0dXJuIDA7Cn0K

MQo0NTcKMQo4NwoxCjMyMAoyCjMKNAo=

1
457
1
87
1
320
2
3
4