Java、Python冒泡排序法(2)

冒泡排序算法JAVA实现代码
import com.jiajia.ArrayUtil.*; // 按包名导入
public class BubbleSortMain {
public static void main(String[] args) {
int[] arr = {3,43,38,5,47,15,36,26,27,2,44,4,50,19,38};
bubbleSort(arr);
ArrayUtil.print(arr);
}
/**
* 冒泡排序
*/
private static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length; i ) {
for (int j = 0; j < arr.length - i -1; j ) { // 这里说明为什么需要-1
if (arr[j] > arr[j 1]) {
int temp = arr[j];
arr[j] = arr[j 1];
arr[j 1] = temp;
}
}
}
}
}
冒泡排序算法python实现代码
def bubble_sort(the_list):
i = 0
while i < len(the_list):
j = 0
while j < len(the_list)-1:
print(the_list[j],the_list[j 1])
if the_list[j] > the_list[j 1]:
the_list[j], the_list[j 1] = the_list[j 1], the_list[j]
j = j 1
print(the_list)
print("======" str(the_list))
i = i 1
return the_list
if __name__ == "__main__":
the_list = [3, 43, 38, 5, 47, 15, 36, 26, 27, 2, 44, 4, 50, 19, 38]