Data structure-bubble sort (Python&java implementation)

1. Core idea of bubbling algorithm
The core idea of bubble sorting is to scan the data list, find the two contiguous data in the order of 22 compare and swap the location, then continue to scan the data, and then repeat the above operations repeatedly until the end of the sorting.
2. Example
We take the 23,15,58,-4,99,0 of this unordered set of numbers as an example: from small to large,
Initial state: 23,15,58, -4,99,0
First sorted results: 15,23,-4,58,0,99
Second sort result: 15,-4,23,0,58,99
Third Order results: -4,15,0,23,58,99
Fourth time sorted results: -4,0,15,23,58,99
Fifth time sorted results: -4,0,15,23,58,99
Sort finished, output final result: -4,0,15,23,58,99
3. Experiment Code
Python implementation

Python test results:

Java Code and test results

Data structure-bubble sort (Python&java implementation)