FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/Selection Sort.java at master · wandechris/Java · GitHub
wandechris
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
Selection Sort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
40 lines (35 loc) · 601 Bytes
Breadcrumbs
Java
/
Selection Sort.java
Copy path
File metadata and controls
40 lines (35 loc) · 601 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
import
java
.
util
.
Scanner
;
class
SelectionSort
{
public
static
void
main
(
String
[]
args
)
{
int
array
[]=
new
int
[
6
];
Scanner
input
=
new
Scanner
(
System
.
in
);
//Input
System
.
out
.
println
(
"Enter any 6 Numbers for Unsorted Array : "
);
for
(
int
i
=
0
;
i
<
6
;
i
++)
{
array
[
i
]=
input
.
nextInt
();
}
//Sorting
for
(
int
i
=
0
;
i
<
6
;
i
++)
{
int
min
=
i
;
for
(
int
j
=
i
+
1
;
j
<
6
;
j
++)
{
if
(
array
[
j
]<
array
[
min
])
{
min
=
j
;
}
}
int
temp
=
array
[
i
];
array
[
i
]=
array
[
min
];
array
[
min
]=
temp
;
}
//Output
for
(
int
i
=
0
;
i
<
6
;
i
++)
{
System
.
out
.
print
(
array
[
i
]+
"
\t
"
);
}
}
}
Back
|
FazBrowse Home
|
New Git URL