bubble sort time complexity
snippet in c

bubble sort

user9490

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

bubble sort lagorithm

user3651

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