forked from 5zhu/algorithm-learning
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSort.java
More file actions
49 lines (44 loc) · 1.18 KB
/
Copy pathSort.java
File metadata and controls
49 lines (44 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package com.algorithdemo.sort;
public class Sort {
public static void main(String[] args) {
int a[]={12,3,45,23,43,31,64,22,1,4,7};
bubbleSort2(a);
for(int i=0;i<a.length;i++)
System.out.println(a[i]);
}
/**
* 冒泡排序
* @param a
*/
public static void bubbleSort(int a[]){
int temp=0;
for(int i=0;i<a.length-1;i++){
for(int j=0;j<a.length-1-i;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
/**
* 冒泡排序改进
* @param a
*/
public static void bubbleSort2(int[] arr){
boolean flag = true;
int temp;//定义一个临时变量
for(int i=1;i<arr.length&&flag;i++){//冒泡趟数，n-1趟
flag = false;
for(int j=0;j<arr.length-i;j++){
if(arr[j+1]<arr[j]){
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
flag = true;
}
}
}
}
}