FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/src/main/java/com/examplehub/sorts/ShellSort.java at master · examplehub/Java · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
examplehub
/
Java
Public
Notifications
You must be signed in to change notification settings
Fork
22
Star
26
Code
Issues
0
Pull requests
1
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
/
src
/
main
/
java
/
com
/
examplehub
/
sorts
/
ShellSort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
36 lines (33 loc) · 989 Bytes
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
examplehub
/
sorts
/
ShellSort.java
Copy path
File metadata and controls
36 lines (33 loc) · 989 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
.
examplehub
.
sorts
;
public
class
ShellSort
implements
Sort
{
@
Override
public
void
sort
(
int
[]
numbers
) {
for
(
int
length
=
numbers
.
length
,
gap
=
length
>>
1
;
gap
>
0
;
gap
>>=
1
) {
for
(
int
i
=
gap
;
i
<
length
; ++
i
) {
int
insertValue
=
numbers
[
i
];
int
j
;
for
(
j
=
i
-
gap
;
j
>=
0
&&
insertValue
<
numbers
[
j
];
j
-=
gap
) {
numbers
[
j
+
gap
] =
numbers
[
j
];
}
if
(
j
!=
i
-
gap
) {
numbers
[
j
+
gap
] =
insertValue
;
}
}
}
}
@
Override
public
<
T
extends
Comparable
<
T
>>
void
sort
(
T
[]
array
) {
for
(
int
length
=
array
.
length
,
gap
=
length
>>
1
;
gap
>
0
;
gap
>>=
1
) {
for
(
int
i
=
gap
;
i
<
length
; ++
i
) {
T
insertValue
=
array
[
i
];
int
j
;
for
(
j
=
i
-
gap
;
j
>=
0
&&
insertValue
.
compareTo
(
array
[
j
]) <
0
;
j
-=
gap
) {
array
[
j
+
gap
] =
array
[
j
];
}
if
(
j
!=
i
-
gap
) {
array
[
j
+
gap
] =
insertValue
;
}
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL