Data-Structures/Sorting_Algorithms/Sorting_Algorithms/Program.cs
/// <summary>
/// Quick Sort is a divide and conquer sorting algorithm using a pivot (partition) 
/// </summary>
/// <param name="arr"></param>
/// <param name="left"></param>
/// <param name="right"></param>
Quick Sort is a divide and conquer sorting algorithm using a pivot (partition)
Quick Sort is a divide and conquer sorting algorithm using a pivot ( partition )
static void QuickSort(int[] arr, int left, int right)
        {
            if (left < right)
            {
                int position = Partition(arr, left, right);
                QuickSort(arr, left, position - 1);
                QuickSort(arr, position + 1, right);
            }
        }
static void QuickSort ( int [ ] arr , int left , int right ) { if ( left < right ) { int position = Partition ( arr , left , right ) ; QuickSort ( arr , left , position - 1 ) ; QuickSort ( arr , position + 1 , right ) ; } }
Quick Sort is a divide and conquer sorting algorithm using a pivot (partition)
Quick Sort is a divide and conquer sorting algorithm using a pivot ( partition )
arr
int[]
None
left
int
None
right
int
None