FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java_Fundamentals/BubbleSort.java at main · devdeepak06/Java_Fundamentals · GitHub
devdeepak06
/
Java_Fundamentals
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
Java_Fundamentals
/
BubbleSort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
41 lines (37 loc) · 1.15 KB
Breadcrumbs
Java_Fundamentals
/
BubbleSort.java
Copy path
File metadata and controls
41 lines (37 loc) · 1.15 KB
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
import
java
.
util
.
Scanner
;
public
class
BubbleSort
{
public
static
void
printArray
(
int
[]
arr
) {
for
(
int
i
=
0
;
i
<
arr
.
length
;
i
++) {
System
.
out
.
print
(
arr
[
i
] +
" "
);
}
System
.
out
.
println
();
}
public
static
void
bubbleSort
(
int
[]
arr
) {
int
n
=
arr
.
length
;
for
(
int
i
=
0
;
i
<
n
-
1
;
i
++) {
for
(
int
j
=
0
;
j
<
n
-
i
-
1
;
j
++) {
if
(
arr
[
j
] >
arr
[
j
+
1
]) {
int
temp
=
arr
[
j
];
arr
[
j
] =
arr
[
j
+
1
];
arr
[
j
+
1
] =
temp
;
}
}
}
}
public
static
void
main
(
String
[]
args
) {
try
(
Scanner
sc
=
new
Scanner
(
System
.
in
)) {
int
t
=
sc
.
nextInt
();
while
(
t
>
0
) {
int
n
=
sc
.
nextInt
();
int
[]
arr
=
new
int
[
n
];
for
(
int
i
=
0
;
i
<
n
;
i
++) {
arr
[
i
] =
sc
.
nextInt
();
}
bubbleSort
(
arr
);
System
.
out
.
println
(
"The sorted array is"
);
printArray
(
arr
);
t
--;
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL