FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java_Learning/18_Basic_Sorting_Algorithm/Quesiton.java at main · TORRYNN/Java_Learning · GitHub
TORRYNN
/
Java_Learning
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
0
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_Learning
/
18_Basic_Sorting_Algorithm
/
Quesiton.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
97 lines (86 loc) · 2.7 KB
Breadcrumbs
Java_Learning
/
18_Basic_Sorting_Algorithm
/
Quesiton.java
Copy path
File metadata and controls
97 lines (86 loc) · 2.7 KB
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
public
class
Quesiton
{
public
static
void
bubblesort
(
int
arr
[]) {
for
(
int
i
=
0
;
i
<
arr
.
length
-
1
;
i
++) {
for
(
int
j
=
0
;
j
<
arr
.
length
-
i
-
1
;
j
++) {
if
(
arr
[
j
] <
arr
[
j
+
1
]) {
int
temp
=
arr
[
j
];
arr
[
j
] =
arr
[
j
+
1
];
arr
[
j
+
1
] =
temp
;
}
}
}
}
public
static
void
selectionsort
(
int
arr
[]) {
int
n
=
arr
.
length
;
for
(
int
i
=
0
;
i
<
n
-
1
;
i
++) {
int
max
=
i
;
for
(
int
j
=
i
+
1
;
j
<
n
;
j
++) {
if
(
arr
[
max
] <
arr
[
j
]) {
max
=
j
;
}
}
int
temp
=
arr
[
max
];
arr
[
max
] =
arr
[
i
];
arr
[
i
] =
temp
;
}
}
public
static
void
insertionsort
(
int
arr
[]) {
int
n
=
arr
.
length
;
for
(
int
i
=
0
;
i
<
n
;
i
++) {
int
j
=
i
;
while
(
j
>
0
&&
arr
[
j
-
1
] <
arr
[
j
]) {
int
temp
=
arr
[
j
];
arr
[
j
] =
arr
[
j
-
1
];
arr
[
j
-
1
] =
temp
;
j
--;
}
}
}
public
static
void
countingsort
(
int
arr
[]) {
int
n
=
arr
.
length
;
int
largest
=
Integer
.
MIN_VALUE
;
for
(
int
i
=
0
;
i
<
n
;
i
++) {
largest
=
Math
.
max
(
largest
,
arr
[
i
]);
}
int
count
[] =
new
int
[
largest
+
1
];
for
(
int
i
=
0
;
i
<
n
;
i
++) {
count
[
arr
[
i
]]++;
}
int
j
=
0
;
for
(
int
i
=
largest
;
i
>=
0
;
i
--) {
while
(
count
[
i
] >
0
) {
arr
[
j
] =
i
;
j
++;
count
[
i
]--;
}
}
}
public
static
void
print
(
int
arr
[]) {
for
(
int
num
:
arr
) {
System
.
out
.
print
(
num
+
" "
);
}
System
.
out
.
println
();
}
public
static
void
main
(
String
[]
args
) {
int
ar
[] = {
3
,
6
,
2
,
1
,
8
,
7
,
4
,
5
,
3
,
1
};
System
.
out
.
println
(
"-------------------Bubble Sort in reverse-------------------"
);
print
(
ar
);
bubblesort
(
ar
);
print
(
ar
);
ar
=
new
int
[] {
3
,
6
,
2
,
1
,
8
,
7
,
4
,
5
,
3
,
1
};
System
.
out
.
println
(
"-------------------Selection Sort in reverse-------------------"
);
print
(
ar
);
selectionsort
(
ar
);
print
(
ar
);
ar
=
new
int
[] {
3
,
6
,
2
,
1
,
8
,
7
,
4
,
5
,
3
,
1
};
System
.
out
.
println
(
"-------------------Insertion Sort in reverse-------------------"
);
print
(
ar
);
insertionsort
(
ar
);
print
(
ar
);
ar
=
new
int
[] {
3
,
6
,
2
,
1
,
8
,
7
,
4
,
5
,
3
,
1
};
System
.
out
.
println
(
"-------------------Counting Sort in reverse-------------------"
);
print
(
ar
);
countingsort
(
ar
);
print
(
ar
);
}
}
Back
|
FazBrowse Home
|
New Git URL