{"id":16634,"date":"2020-07-11T18:19:06","date_gmt":"2020-07-11T12:49:06","guid":{"rendered":"https:\/\/www.mygreatlearning.com\/blog\/bubble-sort\/"},"modified":"2024-09-03T11:24:51","modified_gmt":"2024-09-03T05:54:51","slug":"bubble-sort","status":"publish","type":"post","link":"https:\/\/www.mygreatlearning.com\/blog\/bubble-sort\/","title":{"rendered":"What is Bubble Sort Algorithm Using C,C++, Java and Python"},"content":{"rendered":"\n

What is Bubble Sort <\/strong><\/h2>\n\n\n\n

Bubble sort is one of the easiest and brute force sorting algorithm. It is used to sort elements in either ascending or descending order. Every element is compared with every other element in bubble sort.<\/p>\n\n\n\n

It basically does swapping of elements if they are not in the right order depending on their value and the intended order. A nested loop will be used to implement this algorithm.<\/p>\n\n\n\n

Bubble Sort Pseudocode<\/strong><\/h3>\n\n\n\n
    \n
  1. We are given with an input array which is supposed to be sorted in ascending order<\/li>\n\n\n\n
  2. We start with the first element and i=0 index and check if the element present at i+1 is greater then we swap the elements at index i and i+1.<\/li>\n\n\n\n
  3. If above is not the case, then no swapping will take place.<\/li>\n\n\n\n
  4. Now  \u201c i \u201d gets incremented and the above 2 steps happen again until the array is exhausted.<\/li>\n\n\n\n
  5. We will ignore the last index as it is already sorted.<\/li>\n\n\n\n
  6. Now the largest element will be at the last index of the array.<\/li>\n\n\n\n
  7. Now we will again set i=0 and continue with the same steps that will eventually place second largest at second last place in the array. Now the last 2 indexes of the array are sorted.<\/li>\n<\/ol>\n\n\n\n

    Bubble Sort Algorithm<\/strong><\/h3>\n\n\n\n
    Bubble Sort(arr, size)\n\t\tfor i=0 to n-i-1\n\t\t\tfor j=0 to n-i-2\n\t\t\t\tif arr[j]>arr[j+1]\n\t\t\t\t\tSwap arr[j] and arr[j+1]<\/code><\/pre>\n\n\n\n
    Bubble Sort Algorithm Dry Run<\/strong><\/h3>\n\n\n\n
    input:<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    23<\/td>10<\/td>16<\/td>11<\/td>20<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    After i=0\t<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    10<\/td>16<\/td>11<\/td>20<\/td>23<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    After i=1<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    10<\/td>11<\/td>16<\/td>20<\/td>23<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    After i=2<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    10<\/td>11<\/td>16<\/td>20<\/td>23<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    After i=3<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    10<\/td>11<\/td>16<\/td>20<\/td>23<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    After i=4<\/p>\n\n\n\n
    0<\/td>1<\/td>2<\/td>3<\/td>4<\/td><\/tr>
    10<\/td>11<\/td>16<\/td>20<\/td>23<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
    Bubble Sort Time Complexity<\/strong>
    <\/h3>\n\n\n\n