bubble c code example
Example 1: bubble sort c
#include <bits/stdc++.h>
using namespace std;
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
void bubbleSort(int arr[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)
for (j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
swap(&arr[j], &arr[j+1]);
}
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
cout<<"Sorted array: \n";
printArray(arr, n);
return 0;
}
Example 2: bubble sort in c
#include <stdio.h>
#include <stdbool.h>
int main()
{
int arr[] = { 12, 11, 13, 5, 6 };
int arr_size = sizeof(arr) / sizeof(arr[0]);
int i, j;
bool isSwapped = false;
for (i = 0; i < arr_size; i++) {
for (j = 0; j < arr_size - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
isSwapped = true;
}
}
}
printf("Array After Sorted:\n");
for (i = 0; i < arr_size; i++)
printf("%d ", arr[i]);
return 0;
}