Shulou(Shulou.com)06/01 Report--

This article will explain in detail what it means to sort bubbles in web development. The editor thinks it is very practical, so I share it with you for reference. I hope you can get something after reading this article.

Introduction to Bubble sorting

Bubble sorting is a simple sorting algorithm. It traverses several secondary sorted sequences, and each time, it compares the size of two adjacent numbers from the back to the back, and if the former is larger than the latter, swap their positions. In this way, after a traversal, the largest element is at the end of the sequence! After traversing again in the same way, the second largest element is arranged before the largest element. Repeat this until the entire sequence is in order!

Bubble sort diagram

The following example shows the bubbling sorting process of the sequence {20pc40, 30jpg, 10jc60pct 50} (figure below).

Let's first analyze the sort of the first trip:

A [0] a [2] when iSome5 is jaded 0. At this point, the values of a [1] and a [2] are exchanged; after the exchange, a [1] = 30] a [2] = 40.

A [2] > a [3] when iTunes 5 is jaded 2. At this point, the values of a [2] and a [3] are exchanged; after the exchange, a [2] = 10] a [3] = 40.

A [3] a [5] when iTunes 5 is jaded 3. At this point, the values of a [4] and a [5] are exchanged; after the exchange, a [4] = 50 a [3] = 60.

After the first row, the maximum element 60 is moved to the end of the array, that is, a [5] is the largest element in the array at this time. For the second sorting, you only need to arrange the first five elements according to the above method. Like this:

After the second sorting, a [4] and a [5] are ordered in the sequence.

After the third sorting, a [3], a [4], a [5] are ordered in the sequence.

After the fourth sorting, a [2], [3], a [4], a [5] are ordered in the sequence.

After the fifth sorting, a [1], a [2], [3], a [4], a [5] are ordered in the sequence.

After the fifth sorting, the whole sequence is in order.

Implementation of Bubble sorting algorithm

According to the above process, it is not difficult to write a code implementation of bubble sorting, here in ascending order.

Void bubble_sort (int a [], int n)

{int irecoverjposfor (I > 0; I > 0; iMub -) {/ / put the largest data in a [0... I] at the end of for (jacks 0; j a [j + 1]) swap (a [j], a [j]);}}

}

In fact, if you look at the flow chart of the bubbling sort in the above example, after the third pass, the data is already in order; there is no data exchange between the 4th and 5th rounds. So the bubble sort can be optimized to make it more efficient: add a tag that marks true if a swap occurs during a traversal, or false otherwise. If there is no exchange on a trip, the sorting has been completed and quit. The optimized code is as follows:

Void bubble_sort2 (int a [], int n)

{int irejint flag; / / Mark whether or not to exchange for (I > 0; I > 0; iMel -) {flag= 0; / initialize the mark as 0 flag==0 / put the largest data in a [0.. I] at the end of for (a [j]; j [j + 1]) {swap (a [j], a [jend1]); flag= 1; / occur exchange, let flag be 1} if (exchange) / / if there is no exchange, the sequence is in order.

} time and space complexity of bubble sorting

The time complexity of bubble sorting is O (N2): suppose there are N numbers in the sorted sequence. The time complexity of traversing is O (N). How many times do you need to traverse? Nmuri 1 time! Therefore, the time complexity of bubble sorting is O (N2).

Bubble sorting is a stable algorithm: it satisfies the definition of stable algorithm; the so-called algorithm stability means that for two equal numbers a [I] = a [j] in a sequence, a [I] is in front of a [j] before sorting, and a [I] is still before a [j] after sorting, then the sorting algorithm is stable.

This is the end of this article on "what is the meaning of Bubble sorting in web Development?". I hope the above content can be helpful to you, so that you can learn more knowledge. if you think the article is good, please share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.