Check out example codes for "bubble sort in c". It will help you in understanding the concepts better.

Code Example 1

``````INTUTION:
Tha idea of bubble sort is inspired by Bubbles,
as soon as you heated Water in bicker the larger
bubble moves towards the end in the same way. Just move
the larger bubble towards the end!!

Code:

#include <bits/stdc++.h>
using namespace std;

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]);

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;
}``````

Code Example 2

``````// Por ter uma complexidade alta,
// Complexidade: O(n²) / O(n**2) / O(n^2)

function bubblesort(list) {
const n = list.length;
for (let i = 0; i < n - 1; i += 1) {
for (let j = 0; j < n - 1; j += 1) {
if (list[j] > list[j + 1]) {
[list[j], list[j + 1]] = [list[j + 1], list[j]];
}
}
}
return list;
}

bubblesort([4, 7, 2, 6, 4, 1, 8, 3]);``````

Code Example 3

``````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]);
}``````

Code Example 4

``````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]);
}``````

Learn ReactJs, React Native from akashmittal.com