Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
34 lines (32 loc) · 840 Bytes

File metadata and controls

34 lines (32 loc) · 840 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package sort;
/**
* 冒泡排序
*
* 通过从左到右不断交换相邻逆序的相邻元素,
* 在一轮的交换之后,可以让未排序的元素上浮到右侧。
*
* @author 刘壮飞
* https://github.com/zfman.
* https://blog.csdn.net/lzhuangfei.
*/
public class Buddle<T extends Comparable<T>> extends Sort<T> {
@Override
public void sort(T[] nums) {
int n=nums.length;
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++){
if(less(nums[j+1],nums[j])) {
swap(nums,j,j+1);
}
}
}
}
public static void main(String[] args){
Integer[] arr={
5,1,8,7,10,6,9,5,20,3,0
};
Sort<Integer> sort=new Buddle<>();
sort.sort(arr);
ArrayUtils.printArray(arr);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.