Conclusion of the custom implementation of QuickSort

Author: zevolution

src/main/java/br/com/zevolution/algorithms/sorting/quicksort/QuickSort.java

@@ -1,57 +1,49 @@
 package br.com.zevolution.algorithms.sorting.quicksort;
 
-import java.util.Arrays;
-
 import br.com.zevolution.algorithms.sorting.Product;
+import br.com.zevolution.algorithms.sorting.Sort;
+
+public class QuickSort implements Sort {
+
+	@Override
+	public Product[] sort(Product[] products, int length) {
+		Product[] array = products.clone();
+		this.quickSort(array, 0, length);
+		return array;
 
-public class QuickSort {
-	
-	public static void main(String[] args) {
-		
-		Product[] products = {
-				new Product("iMac", 30000),	
-				new Product("Keyboard", 100),
-				new Product("iPhone 12 Pro Max Ultra Uou", 10000),
-				new Product("Mouse", 50),
-				new Product("Notebook", 3500)
-		};
-		
-		quickSort(products, 0, products.length);
-		
-		System.out.println(Arrays.toString(products));
 	}
 
-	private static void quickSort(Product[] products, int start, int end) {
+	private void quickSort(Product[] products, int start, int end) {
 		int length = end - start; 
 		if (length > 1) {
-			int pivot = partitionProducts(products, start, end);
-			quickSort(products, start, pivot);
-			quickSort(products, pivot + 1, end);
+			int pivot = this.partitionProducts(products, start, end);
+			this.quickSort(products, start, pivot);
+			this.quickSort(products, pivot + 1, end);
 		}
 	}
 
-	private static int partitionProducts(Product[] products, int start, int end) {
+	private int partitionProducts(Product[] products, int start, int end) {
 		int cheapest = start;
-		
+
 		Product pivotProduct = products[end - 1];
 		for (int current = start; current < end - 1; current++) {
 			Product currentProduct = products[current];
 			if (currentProduct.getPrice() <= pivotProduct.getPrice()) {
-				swap(products, current, cheapest);
+				this.swap(products, current, cheapest);
 				cheapest++;
 			}
 		}
-		
-		swap(products, end - 1, cheapest);
-		
+
+		this.swap(products, end - 1, cheapest);
+
 		return cheapest;
 	}
 
-	private static void swap(Product[] products, int from, int to) {
+	private void swap(Product[] products, int from, int to) {
 		Product productFrom = products[from];
 		Product productTo = products[to];
 		products[from] = productTo;
 		products[to] = productFrom;
 	}
 
-}
+}

src/test/java/br/com/zevolution/algorithms/sorting/quicksort/QuickSortTest.java

@@ -0,0 +1,15 @@
+package br.com.zevolution.algorithms.sorting.quicksort;
+
+import static br.com.zevolution.algorithms.sorting.SortTester.testSort;
+import static org.junit.Assert.*;
+
+import org.junit.Test;
+
+public class QuickSortTest {
+
+	@Test
+	public void should_Sort_Array() {
+		testSort(new QuickSort());
+	}
+
+}