#include "stdio.h"
#include "math.h"
#include "stdlib.h"
#include "time.h"
int num = 10;
void swap(int *a,int *b)
{
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void PrintArray(int arr[])
{
int i;
for(i=0; i < num; ++i)
{
printf("%d ", arr[i]);
}
}
int Partition(int *arr, int beg, int end)
{
int j;
int sentinel = arr[end];
int i = beg-1;
for(j=beg; j <= end-1; ++j)
{
if(arr[j] <= sentinel)
{
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i+1], &arr[end]);
printf("\n排序过程:");
PrintArray(arr);
return i+1;
}
int RandomPartition(int *arr, int beg, int end)
{
int i = beg + rand() % (end-beg+1);
swap(&arr[i], &arr[end]);
return Partition(arr, beg, end);
}
void RandomQuickSort(int *arr, int beg, int end)
{
if(beg < end)
{
int pivot = RandomPartition(arr, beg, end);
printf("\n随机选择 arr[%d](%d)", pivot, arr[pivot]);
RandomQuickSort(arr, beg, pivot-1);
printf("\n随机选择 arr[%d](%d)", pivot, arr[pivot]);
RandomQuickSort(arr, pivot+1, end);
}
}
int main()
{
int i;
int arr[10];
srand(time(0));
for(i=0; i < 10; i++)
{
arr[i] = rand()%100+1;
//printf("%d ", rand()%100+1);
}
printf("初始数组:");
PrintArray(arr);
RandomQuickSort(arr, 0, num-1);
printf("\n最后结果:");
PrintArray(arr);
return 0;
}
#include "math.h"
#include "stdlib.h"
#include "time.h"
int num = 10;
void swap(int *a,int *b)
{
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void PrintArray(int arr[])
{
int i;
for(i=0; i < num; ++i)
{
printf("%d ", arr[i]);
}
}
int Partition(int *arr, int beg, int end)
{
int j;
int sentinel = arr[end];
int i = beg-1;
for(j=beg; j <= end-1; ++j)
{
if(arr[j] <= sentinel)
{
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i+1], &arr[end]);
printf("\n排序过程:");
PrintArray(arr);
return i+1;
}
int RandomPartition(int *arr, int beg, int end)
{
int i = beg + rand() % (end-beg+1);
swap(&arr[i], &arr[end]);
return Partition(arr, beg, end);
}
void RandomQuickSort(int *arr, int beg, int end)
{
if(beg < end)
{
int pivot = RandomPartition(arr, beg, end);
printf("\n随机选择 arr[%d](%d)", pivot, arr[pivot]);
RandomQuickSort(arr, beg, pivot-1);
printf("\n随机选择 arr[%d](%d)", pivot, arr[pivot]);
RandomQuickSort(arr, pivot+1, end);
}
}
int main()
{
int i;
int arr[10];
srand(time(0));
for(i=0; i < 10; i++)
{
arr[i] = rand()%100+1;
//printf("%d ", rand()%100+1);
}
printf("初始数组:");
PrintArray(arr);
RandomQuickSort(arr, 0, num-1);
printf("\n最后结果:");
PrintArray(arr);
return 0;
}