algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
Sorts/QuickSort.java
View File

@@ -3,23 +3,17 @@ package Sorts;
import static Sorts.SortUtils.*;
/**
*
* @author Varun Upadhyay (https://github.com/varunu28)
* @author Podshivalov Nikita (https://github.com/nikitap492)
*
*
* @see SortAlgorithm
*
*/
class QuickSort implements SortAlgorithm {
/**
* This method implements the Generic Quick Sort
*
* @param array The array to be sorted
* Sorts the array in increasing order
* Sorts the array in increasing order
**/
@Override
@@ -32,17 +26,16 @@ class QuickSort implements SortAlgorithm {
/**
* The sorting process
*
* @param left The first index of an array
* @param left The first index of an array
* @param right The last index of an array
* @param array The array to be sorted
*
**/
private static <T extends Comparable<T>> void doSort(T[] array, int left, int right) {
if (left < right) {
int pivot = partition(array, left, right);
doSort(array, left, pivot - 1);
doSort(array, pivot , right);
doSort(array, pivot, right);
}
}
@@ -50,23 +43,23 @@ class QuickSort implements SortAlgorithm {
* This method finds the partition index for an array
*
* @param array The array to be sorted
* @param left The first index of an array
* @param left The first index of an array
* @param right The last index of an array
* Finds the partition index of an array
* Finds the partition index of an array
**/
private static <T extends Comparable<T>> int partition(T[] array, int left, int right) {
int mid = (left + right) / 2;
T pivot = array[mid];
while(left <= right) {
while(less(array[left], pivot)){
while (left <= right) {
while (less(array[left], pivot)) {
++left;
}
while(less(pivot, array[right])) {
while (less(pivot, array[right])) {
--right;
}
if(left <= right) {
if (left <= right) {
swap(array, left, right);
++left;
--right;
@@ -79,15 +72,15 @@ class QuickSort implements SortAlgorithm {
public static void main(String[] args) {
// For integer input
Integer[] array = {3, 4, 1, 32, 0, 1, 5, 12 ,2, 5 ,7 ,8 ,9, 2, 44, 111, 5};
Integer[] array = {3, 4, 1, 32, 0, 1, 5, 12, 2, 5, 7, 8, 9, 2, 44, 111, 5};
QuickSort quickSort = new QuickSort();
// quickSort.sort(array);
// quickSort.sort(array);
//Output => 0 1 1 2 2 3 4 5 5 5 7 8 9 12 32 44 111
print(array);
String[] stringArray = {"c", "a", "e", "b", "d"};
String[] stringArray = {"c", "a", "e", "b", "d"};
quickSort.sort(stringArray);
//Output => a b c d e