What is the principle of the Python Bubble Sort algorithm?

The principle of Python’s bubble sort is to continuously compare adjacent elements and swap their positions if they are not in the correct order, until the entire sequence is in order.

The specific steps are as follows:

1. Start from the first element in the sequence and compare the value of the current element with the next element.
2. If the current element is greater than the value of the next element, swap their positions.
3. Continue comparing the next element with the one following it, repeat this process until the largest element is placed at the end of the sequence.
4. Then narrow down the range of the sequence to all elements except the last one.
5. Repeat steps 1 to 4 until the entire sequence is in order.

The time complexity of bubble sort is O(n^2), where n is the length of the sequence.