Python Bubble Sorting Algorithm Implementation Code

1. Algorithm Description:
(1) A total of N-1 cycles
(2) In each loop, if the preceding number is greater than the following number
(3) set a tag. If there is no exchange last time, it indicates that this is done.

2. python Bubble Sorting Code

Copy codeThe Code is as follows:
#! /Usr/bin/python
#-*-Coding: UTF-8 -*-

Def bubble (l ):
Flag = True
For I in range (len (l)-1, 0,-1 ):
If flag:
Flag = False
For j in range (I ):
If l [j]> l [j + 1]:
L [j], l [j + 1] = l [j + 1], l [j]
Flag = True
Else:
Break
Print l

Li = [,]
Bubble (li)


Result: [2, 3, 4, 21, 33, 44, 45, 67]