FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
basic-programs/java/InsertionSort.java at master · BGatya/basic-programs · GitHub
BGatya
/
basic-programs
Public
forked from
utkarsh-shekhar/basic-programs
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
basic-programs
/
java
/
InsertionSort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
33 lines (29 loc) · 924 Bytes
Breadcrumbs
basic-programs
/
java
/
InsertionSort.java
Copy path
File metadata and controls
33 lines (29 loc) · 924 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
public
class
InsertionSortExample
{
public
static
void
main
(
String
[]
args
)
{
//This is unsorted array
Integer
[]
array
=
new
Integer
[] {
12
,
13
,
24
,
10
,
3
,
6
,
90
,
70
};
//Let's sort using insertion sort
insertionSort
(
array
,
0
,
array
.
length
);
//Verify sorted array
System
.
out
.
println
(
Arrays
.
toString
(
array
));
}
@
SuppressWarnings
({
"rawtypes"
,
"unchecked"
})
public
static
void
insertionSort
(
Object
[]
a
,
int
fromIndex
,
int
toIndex
)
{
Object
d
;
for
(
int
i
=
fromIndex
+
1
;
i
<
toIndex
;
i
++)
{
d
=
a
[
i
];
int
j
=
i
;
while
(
j
>
fromIndex
&& ((
Comparable
)
a
[
j
-
1
]).
compareTo
(
d
) >
0
)
{
a
[
j
] =
a
[
j
-
1
];
j
--;
}
a
[
j
] =
d
;
}
}
}
//Output: [3, 6, 10, 12, 13, 24, 70, 90]
Back
|
FazBrowse Home
|
New Git URL