From d73152335801a7d56792339a35d046e26f096d11 Mon Sep 17 00:00:00 2001
From: ianncarvalho <iann.barbosa@ccc.ufcg.edu.br>
Date: Wed, 3 Oct 2018 20:11:43 -0300
Subject: [PATCH] QuickSort Java

---
 Sort/Java/QuickSort.java | 49 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 Sort/Java/QuickSort.java

diff --git a/Sort/Java/QuickSort.java b/Sort/Java/QuickSort.java
new file mode 100644
index 0000000..cd57768
--- /dev/null
+++ b/Sort/Java/QuickSort.java
@@ -0,0 +1,49 @@
+public class QuickSort {
+
+	public static void main(String a[]) {
+		int[] arr1 = { 9, 14, 3, 2, 43, 11, 58, 22 };
+		System.out.println("Before Sort");
+		for (int i : arr1) {
+			System.out.print(i + " ");
+		}
+		System.out.println();
+
+		sort(arr1, 0, arr1.length - 1);// sorting array using insertion sort
+
+		System.out.println("After Sort");
+		for (int i : arr1) {
+			System.out.print(i + " ");
+		}
+	}
+
+	public static void sort(int[] array, int leftIndex, int rightIndex) {
+
+		if (array.length > 1 && leftIndex < rightIndex) {
+			int pivot = partition(array, leftIndex, rightIndex);
+			sort(array, leftIndex, pivot - 1);
+			sort(array, pivot + 1, rightIndex);
+		}
+	}
+
+	private static int partition(int[] array, int leftIndex, int rightIndex) {
+		int i = leftIndex;
+
+		for (int j = leftIndex + 1; j <= rightIndex; j++) {
+			if (array[j] < (array[leftIndex])) {
+				i++;
+				swap(array, i, j);
+			}
+		}
+		swap(array, leftIndex, i);
+		return i;
+	}
+
+	public static void swap(int[] array, int i, int j) {
+		if (array == null)
+			throw new IllegalArgumentException();
+
+		int temp = array[i];
+		array[i] = array[j];
+		array[j] = temp;
+	}
+}