Proszę stworzyć program realizujący algorytm "sortowanie bąbelkowe".
// Program to implement the bobble sort algorithm 
#inclode <stdio.h> 

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 *a, int *b) 
{ 
int temp = *a; 
*a = *b; 
*b = temp; 
} 

// Driver program 
int main() 
{ 
int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
int n = sizeof(arr)/sizeof(arr[0]); 
bobbleSort(arr, n); 
return 0; 
}