GeezerVison is showing github.com — Java/QuickSort.java at main · Eggy115/Java

Expand file tree

QuickSort.java

Copy path

More file actions

35 lines (32 loc) · 1.05 KB

Copy path

35 lines (32 loc) · 1.05 KB

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

import java.util.Arrays;

public class QuickSort {

public static void main(String[] args) {

int[] arr = { 38, 27, 43, 3, 9, 82, 10 };

System.out.println("Unsorted array: " + Arrays.toString(arr));

quickSort(arr, 0, arr.length - 1);

System.out.println("Sorted array: " + Arrays.toString(arr));

}

public static void quickSort(int[] arr, int left, int right) {

if (left < right) {

int pivotIndex = partition(arr, left, right);

quickSort(arr, left, pivotIndex - 1);

quickSort(arr, pivotIndex + 1, right);

}

public static int partition(int[] arr, int left, int right) {

int pivot = arr[right];

int i = left - 1;

for (int j = left; j < right; j++) {

if (arr[j] < pivot) {

i++;

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

}

int temp = arr[i+1];

arr[i+1] = arr[right];

arr[right] = temp;

return i+1;

}