python实现
def mppx(lis, pxcs):
print("冒泡排序:第" + str(pxcs) + "次排序:"+str(lis))
pxcs += 1
j = len(lis) - 1
temp = 0
for i in range(j, 0, -1):
if lis[i] < lis[i - 1]:
temp += 1
temp_num = lis[i]
lis[i] = lis[i - 1]
lis[i - 1] = temp_num
if temp != 0:
return mppx(lis, pxcs)
else:
return lis
if __name__ == '__main__':
pxcs = 0
lis = [123, 34, 5, 5,45, 656, 7, 68]
print(mppx(lis,0))
def bubble_ sort(lis) :
n = len(lis)
for j in range(n-1):
count = 0
for i in range(n-1-j):
if lis[i] > lis[i + 1] :
lis[i], lis[i + 1] = lis[i + 1],lis[i]
count+=1
if count==0:
brea k
if __name__ == '__main__':
lis =[2,7,3,6,9,4]
bubble_ sort(lis)
print(lis)
java实现
class temp{
public static void main(String[] args) {
int[] arr = {3, 5, 2, 1, 4};
bubbleSort(arr);
}
private static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
printArr(arr);
}
private static void printArr(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}
import java.util.Arrays;
import java.util.List;
public class Cs {
public static void main(String[] args) {
int[] lis = {123, 34, 5, 5,45, 656, 7, 68};
System.out.println("冒泡排序最总结果:"+Arrays.toString(mppx(lis, 0)));
}
public static int[] mppx(int[] lis, int cs){
System.out.println("冒泡排序:第"+cs+"次排序:"+ Arrays.toString(lis));
cs++;
int tem=0;
for(int i=lis.length-1;i>0;i--){
if(lis[i]<lis[i-1]){
tem++;
int temp=lis[i];
lis[i]=lis[i-1];
lis[i-1]=temp;
}
}
if(tem==0){
return lis;
}
else {
return mppx(lis,cs);
}
}
}