FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
data-structures-algorithms-python/bubble.java at master · Pradiptadme/data-structures-algorithms-python · GitHub
Pradiptadme
/
data-structures-algorithms-python
Public
forked from
codebasics/data-structures-algorithms-python
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
data-structures-algorithms-python
/
bubble.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
42 lines (29 loc) · 915 Bytes
Breadcrumbs
data-structures-algorithms-python
/
bubble.java
Copy path
File metadata and controls
42 lines (29 loc) · 915 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
import
java
.
util
.
Scanner
;
public
class
BubbleSort
{
public
static
void
main
(
String
[]
args
) {
Scanner
sc
=
new
Scanner
(
System
.
in
);
System
.
out
.
print
(
"Enter number of elements: "
);
int
n
=
sc
.
nextInt
();
int
arr
[] =
new
int
[
n
];
System
.
out
.
println
(
"Enter elements:"
);
for
(
int
i
=
0
;
i
<
n
;
i
++) {
arr
[
i
] =
sc
.
nextInt
();
}
// Bubble Sort
for
(
int
i
=
0
;
i
<
n
-
1
;
i
++) {
for
(
int
j
=
0
;
j
<
n
-
i
-
1
;
j
++) {
if
(
arr
[
j
] >
arr
[
j
+
1
]) {
// Swap
int
temp
=
arr
[
j
];
arr
[
j
] =
arr
[
j
+
1
];
arr
[
j
+
1
] =
temp
;
}
}
}
System
.
out
.
println
(
"Sorted Array:"
);
for
(
int
i
=
0
;
i
<
n
;
i
++) {
System
.
out
.
print
(
arr
[
i
] +
" "
);
}
sc
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL