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

This article mainly introduces "what is the method of compiling bubbling sorting". In the daily operation, I believe that many people have doubts about what the method of compiling bubbling sorting is. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubt of "what is the method of compiling bubbling sorting?" Next, please follow the editor to study!

1. First of all, the definition of bubble sort

Each bubble sort compares the two adjacent elements.

If the preceding element is larger than the later element, the swap is performed

A bubble will move at least one element to where it should be.

Repeat n times and complete the sorting of n elements.

2, legend

3, thinking about the optimization above

In fact, when there is no data exchange in a bubbling operation, it shows that it has reached a complete order.

There is no need to continue the subsequent bubbling operation.

4, so, our final bubble sort can be written like this.

Public void bubbleSort (int [] array) {if (array.length)

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.