How to implement bubble sort algorithm in C#

How to implement the bubble sort algorithm in C

#Bubble sort is a simple but effective sorting algorithm that compares adjacent elements multiple times and Swap positions to arrange an array. In this article, we will introduce how to implement the bubble sort algorithm using C# language and provide specific code examples.

First, let us understand the basic principles of bubble sort. The algorithm starts from the first element of the array and compares it with the next element. If the current element is larger than the next element, swap their positions; if the current element is smaller than the next element, keep their positions unchanged. The algorithm then proceeds to compare the next adjacent element until the entire array is sorted.

The following is a code example for implementing the bubble sort algorithm in C#:

public static void BubbleSort(int[] array)
{
    int n = array.Length;
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - i - 1; j++)
        {
            if (array[j] > array[j + 1])
            {
                // 交换元素的位置
                int temp = array[j];
                array[j] = array[j + 1];
                array[j + 1] = temp;
            }
        }
    }
}

In the above code, we define a static method named BubbleSort, which Accepts an integer array as input parameter. First, we get the length of the array and iterate over the array using two nested loops. The outer loop controls the number of rounds that need to be compared, while the inner loop performs comparisons and position swaps between adjacent elements.

In the inner loop, we use the if statement to check if the current element is greater than the next element. If so, swap their positions. This way, after each round of the loop, the largest element is moved to the end of the array. The inner loop repeats until the entire array is sorted.

Next, we can use the above code to sort an integer array. For example:

int[] numbers = { 64, 34, 25, 12, 22, 11, 90 };
BubbleSort(numbers);
Console.WriteLine("排序后的数组：");
foreach (int number in numbers)
{
    Console.Write(number + " ");
}

In the above code, we create an integer array numbers and store some random integers in it. Then, we call the BubbleSort method to sort the array. Finally, we use foreach to loop through the array and print the sorted results.

The time complexity of the bubble sort algorithm is O(n^2), where n is the length of the array. Although the bubble sort algorithm is not the most efficient sorting algorithm, it is fundamental to understanding sorting algorithms and can still be useful in certain situations.

Hope the above code examples and instructions can help you understand how to implement the bubble sort algorithm in C#. By practicing and mastering this simple and classic algorithm, you will be able to better understand the working principle of the sorting algorithm, and be able to choose a more suitable sorting algorithm according to actual needs.

The above is the detailed content of How to implement bubble sort algorithm in C#. For more information, please follow other related articles on the PHP Chinese website!