Skip to content Skip to footer

Bubble Sort in C#

Sorting algorithms are crucial in computer science and programming as they enable efficient data management. Among the various sorting algorithms, the Bubble Sort algorithm is one of the most straightforward and practical. In this blog post, we will delve into the fundamentals of bubble sorting using the popular programming language.

Bubble sort is a comparison-based algorithm that examines the list multiple times, compares adjacent elements, and swaps them if they are in the wrong order. This sorting algorithm gets its name from how more minor elements “bubble” to the top of the list, like how bubbles rise to the water's .

Bubble sort is easy to understand and implement, making it ideal for beginners who want to grasp the basic sorting concepts. It is beneficial when working with small datasets where sorting efficiency is not a primary concern.

Let's examine the code and explore how bubble sort can be implemented in .

public static void BubbleSort(int[] arr)
  int n = arr.Length;
  for (int i = 0; in - 1; i++)
    for (int j = 0; jn - i - 1; j++)
      if (arr[j] > arr[j + 1])
        int temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;

Let's go through the code step by step:

  1. We define a function called BubbleSort that takes an array of integers (int[] arr) as a parameter.
  2. We initialize a variable n with the array's length. This will be used to control the number of iterations.
  3. We use two nested for loops. The outer loop runs from i = 0 to n - 1. This controls the number of passes through the array.
  4. The inner loop runs from j = 0 to n - i - 1. It compares adjacent elements and swaps them if they are in the wrong order.
  5. Inside the inner loop, we check if arr[j] is greater than arr[j + 1]. If it is, we perform a swap operation using a temporary variable temp.
  6. After completing all the iterations, the array will be sorted in ascending order.

Now that we have implemented the bubble sort algorithm let's see it in action:

int[] numbers = { 5, 2, 8, 12, 1 };
Console.WriteLine("Before sorting:");
foreach (int num in numbers)
  Console.Write(num + " ");


Console.WriteLine("\nAfter sorting:");
foreach (int num in numbers)
  Console.Write(num + " ");

When we run the above code, we should see the following output:

Before sorting:
5 2 8 12 1

After sorting:
1 2 5 8 12

The bubble sort algorithm can effectively sort an array of data in an ascending order. It is worth noting that bubble sort has a time complexity of O(n^2), which is less efficient than other sorting algorithms such as QuickSort and MergeSort. However, its simplicity and easy-to-understand nature make it an excellent choice for beginners learning sorting algorithms.

In summary, bubble sort is a simple yet powerful algorithm for sorting data. By implementing it in , we can better understand the sorting process and its underlying logic. Whether you are a beginner or an experienced programmer, knowing sorting algorithms such as bubble sort is crucial for writing efficient and optimized code.

So, feel free to experiment with bubble sort in and explore its potential in sorting arrays of different sizes.

Leave a comment

Newsletter Signup

The Grid —
The Matrix Has Me
Big Bear Lake, CA 92315

01010011 01111001 01110011 01110100 01100101 01101101 00100000
01000110 01100001 01101001 01101100 01110101 01110010 01100101

What do all men with power want? More powerThe Oracle

Deitasoft © 2024. All Rights Reserved.