diff --git a/src/main/java/com/examplehub/sorts/QuickSort.java b/src/main/java/com/examplehub/sorts/QuickSort.java index 6ac018aa..92eafddd 100644 --- a/src/main/java/com/examplehub/sorts/QuickSort.java +++ b/src/main/java/com/examplehub/sorts/QuickSort.java @@ -1,7 +1,5 @@ package com.examplehub.sorts; -import com.examplehub.utils.SortUtils; - public class QuickSort implements Sort { @Override @@ -11,18 +9,15 @@ public void sort(int[] numbers) { private int partition(int[] number, int left, int right) { int pivot = number[left]; - while (left < right) { - while (left < right && number[right] >= pivot) { + while (left != right) { + while (left != right && number[right] >= pivot) { right--; } - while (left < right && number[left] <= pivot) { - left++; - } - if (left < right) { - SortUtils.swap(number, left, right); + number[left] = number[right]; + while (left != right && number[left] <= pivot) { left++; - right--; } + number[right] = number[left]; } number[left] = pivot; return left; @@ -54,18 +49,15 @@ public > void sort(T[] array) { private static > int partition(T[] array, int left, int right) { T pivot = array[left]; - while (left < right) { - while (left < right && array[right].compareTo(pivot) >= 0) { + while (left != right) { + while (left != right && array[right].compareTo(pivot) >= 0) { right--; } - while (left < right && array[left].compareTo(pivot) <= 0) { + array[left] = array[right]; + while (left != right && array[left].compareTo(pivot) <= 0) { left++; } - if (left < right) { - SortUtils.swap(array, left, right); - left++; - right--; - } + array[right] = array[left]; } array[left] = pivot; return left; pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy