FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java-Advanced/algorithms/sorting/SelectionSortEx.java at master · janbodnar/Java-Advanced · GitHub
janbodnar
/
Java-Advanced
Public
Notifications
You must be signed in to change notification settings
Fork
26
Star
59
Code
Issues
0
Pull requests
6
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-Advanced
/
algorithms
/
sorting
/
SelectionSortEx.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
36 lines (23 loc) · 688 Bytes
Breadcrumbs
Java-Advanced
/
algorithms
/
sorting
/
SelectionSortEx.java
Copy path
File metadata and controls
36 lines (23 loc) · 688 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
package
com
.
zetcode
;
import
java
.
util
.
Arrays
;
public
class
SelectionSortEx
{
private
static
void
doSelectionSort
(
int
[]
a
) {
int
len
=
a
.
length
;
for
(
int
i
=
0
;
i
<
len
-
1
;
i
++) {
int
min_idx
=
i
;
for
(
int
j
=
i
+
1
;
j
<
len
;
j
++) {
if
(
a
[
j
] <
a
[
min_idx
]) {
min_idx
=
j
;
}
}
int
temp
=
a
[
min_idx
];
a
[
min_idx
] =
a
[
i
];
a
[
i
] =
temp
;
}
}
public
static
void
main
(
String
args
[]) {
int
nums
[] = {
3
,
7
,
1
,
15
,
12
,
6
,
11
,
9
};
doSelectionSort
(
nums
);
System
.
out
.
println
(
Arrays
.
toString
(
nums
));
}
}
Back
|
FazBrowse Home
|
New Git URL