FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/src/com/ljj/algorithm/sort/BubbleSort.java at master · CCodingMan/algorithm · GitHub
CCodingMan
/
algorithm
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
src
/
com
/
ljj
/
algorithm
/
sort
/
BubbleSort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (45 loc) · 966 Bytes
Breadcrumbs
algorithm
/
src
/
com
/
ljj
/
algorithm
/
sort
/
BubbleSort.java
Copy path
File metadata and controls
51 lines (45 loc) · 966 Bytes
Raw
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package
com
.
ljj
.
algorithm
.
sort
;
public
class
BubbleSort
{
public
static
void
main
(
String
[]
args
) {
//待排序数组
int
[]
array
= {
99
,
45
,
101
,
2
,
36
,
55
,
4
,
88
,
898
};
System
.
out
.
println
(
"排序前数组: "
);
//输出排序前数组
printArray
(
array
);
//排序后数组
int
[]
sortArray
=
sort
(
array
);
System
.
out
.
println
(
"排序后数组: "
);
//输出排序后数组
printArray
(
sortArray
);
}
/**
* 冒泡排序
* @Title: sort
* @param array
* @return int[]
* @throws
*/
public
static
int
[]
sort
(
int
[]
array
) {
int
isChange
=
0
;
for
(
int
i
=
0
;
i
<
array
.
length
-
1
;
i
++) {
for
(
int
j
=
0
;
j
<
array
.
length
-
i
-
1
;
j
++) {
}
}
return
null
;
}
/**
* 打印数组
* @Title: printArray
* @param array
* @throws
*/
public
static
void
printArray
(
int
[]
array
) {
for
(
int
i
:
array
) {
if
(
i
==
array
.
length
-
1
) {
System
.
out
.
print
(
i
);
}
else
{
System
.
out
.
print
(
i
+
","
);
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL