Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Quick Sort in C++
#include <iostream>
void printArray(int *array, int n)
{
for (int i = 0; i < n; ++i)
std::cout << array[i] << std::endl;
}
void quickSort(int *array, int low, int high)
{
int i = low;
int j = high;
int pivot = array[(i + j) / 2];
int temp;
while (i <= j)
{
while (array[i] < pivot)
i++;
while (array[j] > pivot)
j--;
if (i <= j)
{
temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
}
if (j > low)
quickSort(array, low, j);
if (i < high)
quickSort(array, i, high);
}
int main()
{
int array[] = {95, 45, 48, 98, 1, 485, 65, 478, 1, 2325};
int n = sizeof(array)/sizeof(array[0]);
std::cout << "Before Quick Sort :" << std::endl;
printArray(array, n);
quickSort(array, 0, n);
std::cout << "After Quick Sort :" << std::endl;
printArray(array, n);
return (0);
}
@zqp2013
Copy link

zqp2013 commented Jun 10, 2020

quickSort(array, 0, n-1); high must be n-1.

@Llewellynvdm
Copy link

Llewellynvdm commented Jun 21, 2020

quickSort(array, 0, n-1); high must be n-1.

👍

@kalDima1218
Copy link

kalDima1218 commented Apr 22, 2021

Там n+1 должно быть в последнем выводе

#include

void printArray(int *array, int n)
{
for (int i = 0; i < n; ++i)
std::cout << array[i] << std::endl;
}

void quickSort(int *array, int low, int high)
{
int i = low;
int j = high;
int pivot = array[(i + j) / 2];
int temp;

while (i <= j)
{
    while (array[i] < pivot)
        i++;
    while (array[j] > pivot)
        j--;
    if (i <= j)
    {
        temp = array[i];
        array[i] = array[j];
        array[j] = temp;
        i++;
        j--;
    }
}
if (j > low)
    quickSort(array, low, j);
if (i < high)
    quickSort(array, i, high);

}

int main()
{
int array[] = {95, 45, 48, 98, 1, 485, 65, 478, 1, 2325, 37};
int n = sizeof(array)/sizeof(array[0]);

std::cout << "Before Quick Sort :" << std::endl;
printArray(array, n);

quickSort(array, 0, n);

std::cout << "After Quick Sort :" << std::endl;
printArray(array, n+1);
return (0);

}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment