FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
java/algorithms/sorting/QuickSort.java at master · AllAlgorithms/java · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
This repository was archived by the owner on Sep 7, 2025. It is now read-only.
AllAlgorithms
/
java
Public archive
Notifications
You must be signed in to change notification settings
Fork
83
Star
116
Code
Issues
3
Pull requests
6
Actions
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
java
/
algorithms
/
sorting
/
QuickSort.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
98 lines (86 loc) · 2.25 KB
Breadcrumbs
java
/
algorithms
/
sorting
/
QuickSort.java
Copy path
File metadata and controls
98 lines (86 loc) · 2.25 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
98
/**
* Java implementation of quick sort
*
* @author Tibeyev Timur (timurtibeyev@gmail.com)
*/
public
class
QuickSort
{
/**
* Method responsible for sorting array.
*
* @param arr array of elements
* @param left start of the segment to sort
* @param right end of the segment to sort
*/
private
void
sort
(
int
[]
arr
,
int
left
,
int
right
) {
if
(
left
>=
right
) {
return
;
}
int
i
=
left
;
int
j
=
right
;
int
mid
= (
i
+
j
) /
2
;
// Pivot element
int
v
=
arr
[
mid
];
while
(
i
<
j
) {
// Find element from the left side, which is equal or greater than pivot element
while
(
arr
[
i
] <
v
) {
i
++;
}
// Find element from the right side, which is equal or less than pivot element
while
(
v
<
arr
[
j
]) {
j
--;
}
// If such elements exist, perform swapping
if
(
i
<=
j
) {
swap
(
arr
,
i
,
j
);
i
++;
j
--;
}
}
// Recursively sort left subarray
sort
(
arr
,
left
,
j
);
// Recursively sort right subarray
sort
(
arr
,
i
,
right
);
}
/**
* Swaps two elements.
*
* @param arr array of elements
* @param i first index
* @param j second index
*/
private
void
swap
(
int
[]
arr
,
int
i
,
int
j
) {
int
buf
=
arr
[
i
];
arr
[
i
] =
arr
[
j
];
arr
[
j
] =
buf
;
}
/**
* Entry point, invokes sorting methods and prints resulting array.
*
* @param arr array to sort
*/
public
void
run
(
int
[]
arr
) {
sort
(
arr
,
0
,
arr
.
length
-
1
);
printArray
(
arr
);
}
/**
* Utility method to print array.
*
* @param arr array to print
*/
private
void
printArray
(
int
[]
arr
) {
for
(
int
i
:
arr
) {
System
.
out
.
print
(
i
+
" "
);
}
System
.
out
.
println
();
}
/**
* {@code Main} method. Initializes {@link QuickSort} object and passes simple
* array to sort.
*
* @param args cmd arguments
*/
public
static
void
main
(
String
args
[]) {
int
arr
[] = {
100
,
19
,
23
,
1
,
4
,
23
,
66
};
new
QuickSort
().
run
(
arr
);
}
}
Back
|
FazBrowse Home
|
New Git URL