像合并排序一样,快速排序也是基于分治模式。
int partition(int array_data[], int start_index, int end_index)
{
int data = array_data[end_index];
int i = start_index;
for(int j = start_index; j < end_index; j++)
{
if(array_data[j] < data)
{
if(i != j)
{
int temp_data = array_data[j];
array_data[j] = array_data[i];
array_data[i] = temp_data;
}
i++;
}
}
array_data[end_index] = array_data[i];
array_data[i] = data;
return i;
}
void quick_sort(int array_data[], int start_index, int end_index)
{
if(start_index < end_index)
{
int middle_index = partition(array_data, start_index, end_index);
quick_sort(array_data, start_index, middle_index - 1);
quick_sort(array_data, middle_index + 1, end_index);
}
}