| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.SortAnArray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class SortAnArrayQuickSort : ISortAnArray |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n) |
| | | 19 | | /// Space complexity - O(n log n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[] SortArray(int[] nums) |
| | 2 | 24 | | { |
| | 2 | 25 | | SortArray(nums, 0, nums.Length - 1); |
| | | 26 | | |
| | 2 | 27 | | return nums; |
| | 2 | 28 | | } |
| | | 29 | | |
| | | 30 | | private static void SortArray(IList<int> nums, int left, int right) |
| | 14 | 31 | | { |
| | 14 | 32 | | if (left >= right) |
| | 8 | 33 | | { |
| | 8 | 34 | | return; |
| | | 35 | | } |
| | | 36 | | |
| | 6 | 37 | | var partitionIndex = Partition(nums, left, right); |
| | | 38 | | |
| | 6 | 39 | | SortArray(nums, left, partitionIndex - 1); |
| | 6 | 40 | | SortArray(nums, partitionIndex + 1, right); |
| | 14 | 41 | | } |
| | | 42 | | |
| | | 43 | | private static int Partition(IList<int> array, int low, int high) |
| | 6 | 44 | | { |
| | 42 | 45 | | for (var j = low; j < high; j++) |
| | 15 | 46 | | { |
| | 15 | 47 | | if (array[j] > array[high]) |
| | 10 | 48 | | { |
| | 10 | 49 | | continue; |
| | | 50 | | } |
| | | 51 | | |
| | 5 | 52 | | (array[low], array[j]) = (array[j], array[low]); |
| | | 53 | | |
| | 5 | 54 | | low++; |
| | 5 | 55 | | } |
| | | 56 | | |
| | 6 | 57 | | (array[low], array[high]) = (array[high], array[low]); |
| | | 58 | | |
| | 6 | 59 | | return low; |
| | 6 | 60 | | } |
| | | 61 | | } |