{"id":113720,"date":"2026-06-07T15:00:45","date_gmt":"2026-06-07T09:30:45","guid":{"rendered":"https:\/\/www.guvi.in\/blog\/?p=113720"},"modified":"2026-06-07T15:00:49","modified_gmt":"2026-06-07T09:30:49","slug":"bubble-sort-in-c","status":"publish","type":"post","link":"https:\/\/www.guvi.in\/blog\/bubble-sort-in-c\/","title":{"rendered":"Bubble Sort in C: A Complete Beginner\u2019s Guide"},"content":{"rendered":"\n

Imagine you have a pile of unsorted cards on a table. You want to arrange them in order. One simple approach is to compare adjacent cards and swap them if they are in the wrong order. You repeat this process until all cards are sorted. This is exactly how bubble sort works.<\/p>\n\n\n\n

Bubble sort is one of the simplest sorting algorithms and one of the best ways to learn how sorting works. Even though it is not the fastest algorithm for large datasets, it is perfect for beginners because the logic is easy to understand. You compare two items, swap them if needed, and repeat until everything is sorted.<\/p>\n\n\n\n

If you are learning to program in C, studying data structures, or trying to understand sorting algorithms, bubble sort is the perfect starting point. It teaches you fundamental concepts like loops, comparisons, and array manipulation.<\/p>\n\n\n\n

This guide explains what bubble sort in C is, how the algorithm works step by step, and shows you complete C code examples you can run and modify.<\/p>\n\n\n\n

Quick TL;DR Summary<\/strong><\/h2>\n\n\n\n
    \n
  1. This guide explains bubble sort, a simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order until the entire array is sorted.
    <\/li>\n\n\n\n
  2. You will learn how bubble sort works through step-by-step examples, why it is called bubble sort, and how the algorithm keeps making passes through the data until no more swaps are needed.
    <\/li>\n\n\n\n
  3. The guide covers complete C code implementations including the basic version and optimized versions that stop early when the array is already sorted.
    <\/li>\n\n\n\n
  4. You will understand the time and space complexity of bubble sort, how to analyze its performance, and when bubble sort is actually useful despite being slower than other algorithms.
    <\/li>\n\n\n\n
  5. You will see practical examples of sorting numbers and strings using bubble sort in C, and learn how to modify the code for different scenarios.<\/li>\n<\/ol>\n\n\n\n
    \n\n
    \n\n \n
    <\/div>\n\n \n

    \n What Is Bubble Sort?\n <\/h3>\n\n \n

    \n Bubble sort is a simple sorting algorithm that repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order. Each pass through the list pushes the largest unsorted element to its correct position, similar to bubbles rising to the surface\u2014hence the name. The process continues until no swaps are needed, indicating that the list is fully sorted. Although easy to understand and implement, bubble sort is inefficient for large datasets compared to more advanced sorting algorithms.\n <\/p>\n\n <\/div>\n\n<\/div>\n\n\n\n

    The algorithm gets its name because smaller elements “bubble” to the top (beginning) of the list with each pass, similar to how bubbles rise to the surface of water.<\/p>\n\n\n\n

    Bubble sort<\/a> is one of the easiest sorting algorithms<\/a> to understand and implement. It requires no extra space beyond the array itself. However, it is slow for large datasets compared to algorithms like quicksort or mergesort.<\/p>\n\n\n\n

    Read More: <\/strong>Sorting in Data Structure: Categories & Types<\/strong><\/a><\/p>\n\n\n\n

    How Bubble Sort Works<\/strong><\/h2>\n\n\n\n

    Step 1: Compare the first two elements<\/strong><\/h3>\n\n\n\n

    Start at the beginning of the array<\/a>. Look at the first element and the second element. Compare them to see which is larger.<\/p>\n\n\n\n

    Step 2: Swap if needed<\/strong><\/h3>\n\n\n\n

    If the first element is larger than the second, swap them. The larger element moves forward. If the first element is smaller, leave them as they are.<\/p>\n\n\n\n

    Step 3: Move to the next pair<\/strong><\/h3>\n\n\n\n

    Move to the next pair of adjacent elements (second and third). Compare them and swap if needed. Continue this process through the entire array.<\/p>\n\n\n\n

    Step 4: Complete one pass<\/strong><\/h3>\n\n\n\n

    After comparing and swapping all adjacent pairs, you have completed one pass through the array. The largest unsorted element is now in its correct position at the end.<\/p>\n\n\n\n

    Step 5: Repeat until sorted<\/strong><\/h3>\n\n\n\n

    Do another pass through the array, but this time stop one position earlier because you know the last position is already correct. Continue making passes, reducing the range each time, until no swaps occur in a complete pass.<\/p>\n\n\n\n

    Why the name bubble sort?<\/strong><\/h3>\n\n\n\n

    After each pass, the largest unsorted element moves to its correct position like a bubble rising through water. With each pass, more elements settle into their correct positions. Eventually, all elements are sorted.<\/p>\n\n\n\n

    \n \ud83d\udca1 Did You Know?<\/strong>\n

    \n Bubble sort<\/strong> is one of the earliest and simplest sorting algorithms introduced in computer science education. It works by repeatedly comparing adjacent elements and swapping them if they are in the wrong order, causing smaller elements to gradually \u201cbubble\u201d toward the beginning of the list\u2014hence its name, sometimes also referred to as \u201csinking sort\u201d<\/strong>. Although it is inefficient for large datasets due to its O(n\u00b2)<\/strong> time complexity, bubble sort remains widely taught because it provides a clear and intuitive introduction to fundamental algorithmic concepts such as iteration, comparison, and in-place sorting, serving as a stepping stone to more advanced sorting techniques.\n <\/p>\n<\/div>\n\n\n\n

    Simple Bubble Sort in C<\/strong><\/h2>\n\n\n\n
      \n
    1. Complete C code for basic bubble sort<\/strong><\/li>\n<\/ol>\n\n\n\n

      #include <stdio.h><\/p>\n\n\n\n

      void bubbleSort(int array[], int size) {<\/p>\n\n\n\n

          \/\/ Outer loop for the number of passes<\/p>\n\n\n\n

          for (int i = 0; i < size – 1; i++) {<\/p>\n\n\n\n

              \/\/ Inner loop for comparing adjacent elements<\/p>\n\n\n\n

              for (int j = 0; j < size – i – 1; j++) {<\/p>\n\n\n\n

                  \/\/ Compare adjacent elements<\/p>\n\n\n\n

                  if (array[j] > array[j + 1]) {<\/p>\n\n\n\n

                      \/\/ Swap if left is larger than right<\/p>\n\n\n\n

                      int temp = array[j];<\/p>\n\n\n\n

                      array[j] = array[j + 1];<\/p>\n\n\n\n

                      array[j + 1] = temp;<\/p>\n\n\n\n

                  }<\/p>\n\n\n\n

              }<\/p>\n\n\n\n

          }<\/p>\n\n\n\n

      }<\/p>\n\n\n\n

      void printArray(int array[], int size) {<\/p>\n\n\n\n

          for (int i = 0; i < size; i++) {<\/p>\n\n\n\n

              printf(“%d “, array[i]);<\/p>\n\n\n\n

          }<\/p>\n\n\n\n

          printf(“\\n”);<\/p>\n\n\n\n

      }<\/p>\n\n\n\n

      int main() {<\/p>\n\n\n\n

          int array[] = {64, 34, 25, 12, 22, 11, 90};<\/p>\n\n\n\n

          int size = 7;<\/p>\n\n\n\n

          printf(“Original array: “);<\/p>\n\n\n\n

          printArray(array, size);<\/p>\n\n\n\n

          bubbleSort(array, size);<\/p>\n\n\n\n

          printf(“Sorted array: “);<\/p>\n\n\n\n

          printArray(array, size);<\/p>\n\n\n\n

          return 0;<\/p>\n\n\n\n

      }<\/p>\n\n\n\n

        \n
      1. How the code works<\/strong><\/li>\n<\/ol>\n\n\n\n

        The bubbleSort function takes an array and its size as parameters. The outer loop controls how many passes through the array you make. The inner loop compares adjacent elements and swaps them if the left element is larger.<\/p>\n\n\n\n

        The swap is done using a temporary variable. You store the first value in temp, move the second value to the first position, and then place the temp value in the second position.<\/p>\n\n\n\n

          \n
        1. Output of the program<\/strong><\/li>\n<\/ol>\n\n\n\n

          Original array: 64 34 25 12 22 11 90<\/p>\n\n\n\n

          Sorted array: 11 12 22 25 34 64 90<\/p>\n\n\n\n

            \n
          1. Understanding the pass process<\/strong><\/li>\n<\/ol>\n\n\n\n

            In the first pass, the largest element (90) bubbles to the end. In the second pass, the second-largest element (64) settles into position. With each pass, one more element finds its correct location. After six passes (size – 1), all seven elements are sorted.<\/p>\n\n\n\n

            Did you know? Bubble sort is sometimes used ironically in programming challenges as a joke or difficulty test. This actually teaches valuable lessons about algorithm efficiency and why choosing the right algorithm matters. Most experienced developers avoid bubble sort in production code. <\/em><\/p>\n\n\n\n

            Optimized Bubble Sort<\/strong><\/h2>\n\n\n\n
              \n
            1. The problem with basic bubble sort<\/strong><\/li>\n<\/ol>\n\n\n\n

              The basic version makes the same number of passes regardless of whether the array becomes sorted early. If your array is already sorted, the basic version still does all the passes and comparisons.<\/p>\n\n\n\n

                \n
              1. Optimized version with early stopping<\/strong><\/li>\n<\/ol>\n\n\n\n

                #include <stdio.h><\/p>\n\n\n\n

                void optimizedBubbleSort(int array[], int size) {<\/p>\n\n\n\n

                    \/\/ Outer loop for passes<\/p>\n\n\n\n

                    for (int i = 0; i < size – 1; i++) {<\/p>\n\n\n\n

                        int swapped = 0;  \/\/ Flag to check if swap occurred<\/p>\n\n\n\n

                        \/\/ Inner loop for comparing adjacent elements<\/p>\n\n\n\n

                        for (int j = 0; j < size – i – 1; j++) {<\/p>\n\n\n\n

                            if (array[j] > array[j + 1]) {<\/p>\n\n\n\n

                                \/\/ Swap elements<\/p>\n\n\n\n

                                int temp = array[j];<\/p>\n\n\n\n

                                array[j] = array[j + 1];<\/p>\n\n\n\n

                                array[j + 1] = temp;<\/p>\n\n\n\n

                                swapped = 1;  \/\/ Mark that a swap happened<\/p>\n\n\n\n

                            }<\/p>\n\n\n\n

                        }<\/p>\n\n\n\n

                        \/\/ If no swap occurred, array is already sorted<\/p>\n\n\n\n

                        if (swapped == 0) {<\/p>\n\n\n\n

                            break;  \/\/ Exit early<\/p>\n\n\n\n

                        }<\/p>\n\n\n\n

                    }<\/p>\n\n\n\n

                }<\/p>\n\n\n\n

                void printArray(int array[], int size) {<\/p>\n\n\n\n

                    for (int i = 0; i < size; i++) {<\/p>\n\n\n\n

                        printf(“%d “, array[i]);<\/p>\n\n\n\n

                    }<\/p>\n\n\n\n

                    printf(“\\n”);<\/p>\n\n\n\n

                }<\/p>\n\n\n\n

                int main() {<\/p>\n\n\n\n

                    int array[] = {11, 12, 22, 25, 34, 64, 90};<\/p>\n\n\n\n

                    int size = 7;<\/p>\n\n\n\n

                    printf(“Original array: “);<\/p>\n\n\n\n

                    printArray(array, size);<\/p>\n\n\n\n

                    optimizedBubbleSort(array, size);<\/p>\n\n\n\n

                    printf(“Sorted array: “);<\/p>\n\n\n\n

                    printArray(array, size);<\/p>\n\n\n\n

                    return 0;<\/p>\n\n\n\n

                }<\/p>\n\n\n\n

                  \n
                1. How optimization helps<\/strong><\/li>\n<\/ol>\n\n\n\n

                  The optimized version uses a flag called swapped to track whether any swap occurred during a pass. If a complete pass happens with no swaps, it means the array is already sorted. The algorithm<\/a> stops immediately instead of continuing through remaining passes.<\/p>\n\n\n\n

                  For nearly sorted arrays, this optimization saves significant time. For already sorted arrays, the algorithm completes in just one pass instead of multiple passes.<\/p>\n\n\n\n

                  Bubble Sort for Sorting Strings<\/strong><\/h2>\n\n\n\n
                    \n
                  1. C code to sort strings alphabetically<\/strong><\/li>\n<\/ol>\n\n\n\n

                    #include <stdio.h><\/p>\n\n\n\n

                    #include <string.h><\/p>\n\n\n\n

                    void bubbleSortStrings(char words[][50], int size) {<\/p>\n\n\n\n

                        \/\/ Outer loop for passes<\/p>\n\n\n\n

                        for (int i = 0; i < size – 1; i++) {<\/p>\n\n\n\n

                            \/\/ Inner loop for comparing adjacent strings<\/p>\n\n\n\n

                            for (int j = 0; j < size – i – 1; j++) {<\/p>\n\n\n\n

                                \/\/ Compare strings using strcmp<\/p>\n\n\n\n

                                if (strcmp(words[j], words[j + 1]) > 0) {<\/p>\n\n\n\n

                                    \/\/ Swap strings if first is alphabetically after second<\/p>\n\n\n\n

                                    char temp[50];<\/p>\n\n\n\n

                                    strcpy(temp, words[j]);<\/p>\n\n\n\n

                                    strcpy(words[j], words[j + 1]);<\/p>\n\n\n\n

                                    strcpy(words[j + 1], temp);<\/p>\n\n\n\n

                                }<\/p>\n\n\n\n

                            }<\/p>\n\n\n\n

                        }<\/p>\n\n\n\n

                    }<\/p>\n\n\n\n

                    void printStrings(char words[][50], int size) {<\/p>\n\n\n\n

                        for (int i = 0; i < size; i++) {<\/p>\n\n\n\n

                            printf(“%s “, words[i]);<\/p>\n\n\n\n

                        }<\/p>\n\n\n\n

                        printf(“\\n”);<\/p>\n\n\n\n

                    }<\/p>\n\n\n\n

                    int main() {<\/p>\n\n\n\n

                        char words[5][50] = {“zebra”, “apple”, “mango”, “banana”, “cherry”};<\/p>\n\n\n\n

                        int size = 5;<\/p>\n\n\n\n

                        printf(“Original words: “);<\/p>\n\n\n\n

                        printStrings(words, size);<\/p>\n\n\n\n

                        bubbleSortStrings(words, size);<\/p>\n\n\n\n

                        printf(“Sorted words: “);<\/p>\n\n\n\n

                        printStrings(words, size);<\/p>\n\n\n\n

                        return 0;<\/p>\n\n\n\n

                    }<\/p>\n\n\n\n

                      \n
                    1. Key differences for sorting strings<\/strong><\/li>\n<\/ol>\n\n\n\n

                      Instead of comparing numbers with >, you use strcmp() function to compare strings. The strcmp() function returns a positive value if the first string comes alphabetically after the second string.<\/p>\n\n\n\n

                      Use strcpy() to copy string values instead of simple variable assignment. You cannot assign strings directly in C, so you use string copy functions for swapping.<\/p>\n\n\n\n

                        \n
                      1. Output<\/strong><\/li>\n<\/ol>\n\n\n\n

                        Original words: zebra apple mango banana cherry<\/p>\n\n\n\n

                        Sorted words: apple banana cherry mango zebra<\/p>\n\n\n\n

                        Time Complexity of Bubble Sort<\/strong><\/h2>\n\n\n\n
                          \n
                        1. Best case: O(n)<\/strong><\/li>\n<\/ol>\n\n\n\n

                          If the array is already sorted, the optimized version completes in one pass with no swaps. Time complexity is O(n) because you make one pass through n elements. This is the fastest possible performance for bubble sort.<\/p>\n\n\n\n

                            \n
                          1. Average case: O(n\u00b2)<\/strong><\/li>\n<\/ol>\n\n\n\n

                            For random data, bubble sort makes approximately n\u00b2\/2 comparisons and swaps. This simplifies to O(n\u00b2). If you have 100 elements, expect roughly 5000 operations.<\/p>\n\n\n\n

                              \n
                            1. Worst case: O(n\u00b2)<\/strong><\/li>\n<\/ol>\n\n\n\n

                              If the array is sorted in reverse order, bubble sort needs the maximum number of passes and comparisons. It still makes approximately n\u00b2\/2 operations, which is O(n\u00b2).<\/p>\n\n\n\n

                                \n
                              1. Space complexity: O(1)<\/strong><\/li>\n<\/ol>\n\n\n\n

                                Bubble sort<\/a> requires only a small amount of extra space for the temporary variable during swaps. It does not need extra arrays or data structures. Space complexity is O(1), meaning constant space regardless of input size.<\/p>\n\n\n\n

                                  \n
                                1. Why bubble sort is slow<\/strong><\/li>\n<\/ol>\n\n\n\n

                                  For large datasets, O(n\u00b2) becomes very slow. For 10,000 elements, you need about 50 million operations. For 100,000 elements, you need about 5 billion operations. Faster algorithms like quicksort with O(n log n) are much better for large datasets.<\/p>\n\n\n\n

                                  To learn more about Pointers in C, enroll in this HCL GUVI\u2019s <\/strong>C Programming course <\/strong><\/a>designed for beginners and aspiring developers. The course covers essential C programming concepts including pointers, memory management, arrays, functions, file handling, loops, operators, and more through hands-on practice and real-world examples. With self-paced learning, expert guidance, and an industry-recognized NSDC certification<\/strong>, this course helps you strengthen your programming fundamentals and coding skills.<\/p>\n\n\n\n

                                  Conclusion<\/strong><\/h2>\n\n\n\n

                                  Bubble sort is one of the simplest sorting algorithms and perfect for beginners learning to code. It repeatedly compares adjacent elements and swaps them until the entire array is sorted.<\/p>\n\n\n\n

                                  The algorithm is easy to understand with clear logic. You compare, swap if needed, and repeat. Despite being slow for large datasets with O(n\u00b2) time complexity, bubble sort teaches important programming concepts.<\/p>\n\n\n\n

                                  The optimized version with early stopping is much better than the basic version. It detects when the array is sorted and stops immediately, saving unnecessary passes.<\/p>\n\n\n\n

                                  Bubble sort is best used for learning, small datasets, or nearly sorted data. For large datasets in production code, use faster algorithms like quicksort or mergesort.<\/p>\n\n\n\n

                                  FAQs<\/strong><\/h2>\n\n\n
                                  \n
                                  \n
                                  \n

                                  1. Why is bubble sort called bubble sort?<\/strong><\/h3>\n
                                  \n\n

                                  The algorithm gets its name because larger elements “bubble” to their correct positions at the end of the array with each pass, similar to how bubbles rise through water. After each pass, one more element settles into its final sorted position.<\/p>\n\n<\/div>\n<\/div>\n

                                  \n

                                  2. What is the time complexity of bubble sort?<\/strong><\/h3>\n
                                  \n\n

                                  Best case is O(n) for already sorted data using optimized version. Average and worst cases are O(n\u00b2). This means for 1000 elements, you need about 1 million comparisons in the worst case. Faster algorithms like quicksort use O(n log n) time.<\/p>\n\n<\/div>\n<\/div>\n

                                  \n

                                  3. Is bubble sort used in real applications?<\/strong><\/h3>\n
                                  \n\n

                                  Bubble sort is rarely used in production code for sorting data. However, the concept is fundamental in education. Some specialized situations use bubble sort-like approaches, but modern systems use more efficient algorithms.<\/p>\n\n<\/div>\n<\/div>\n

                                  \n

                                  4. Can I sort in descending order with bubble sort?<\/strong><\/h3>\n
                                  \n\n

                                  Yes, just change the comparison from > to <. Instead of swapping when the left element s larger, swap when it is smaller. This sorts the array in descending order.<\/p>\n\n<\/div>\n<\/div>\n

                                  \n

                                  5. How does bubble sort compare to other algorithms?<\/strong><\/h3>\n
                                  \n\n

                                  Bubble sort is slower than quicksort, mergesort, and heapsort. However, it uses less space than mergesort and is simpler to understand. For production code, use optimized sorting provided by your language libraries.<\/p>\n\n<\/div>\n<\/div>\n<\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"

                                  Imagine you have a pile of unsorted cards on a table. You want to arrange them in order. One simple approach is to compare adjacent cards and swap them if they are in the wrong order. You repeat this process until all cards are sorted. This is exactly how bubble sort works. Bubble sort is […]<\/p>\n","protected":false},"author":63,"featured_media":115159,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[37],"tags":[],"views":"45","authorinfo":{"name":"Vishalini Devarajan","url":"https:\/\/www.guvi.in\/blog\/author\/vishalini\/"},"thumbnailURL":"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/bubble-sort-in-c-300x115.webp","_links":{"self":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/113720"}],"collection":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/users\/63"}],"replies":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/comments?post=113720"}],"version-history":[{"count":3,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/113720\/revisions"}],"predecessor-version":[{"id":115160,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/113720\/revisions\/115160"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/media\/115159"}],"wp:attachment":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/media?parent=113720"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/categories?post=113720"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/tags?post=113720"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}