程序代码集合.doc

//快速排序法
#include <iostream>
#include <iomanip>
#include <>
#include <>
#define MIN -65536
using namespace std;
int * Create_Array (int *, int);
void Print_Array (int *, int);
void Exchange (int *, int, int);
int Partition (int *, int, int);
void Quick_Sort (int *, int, int);
int main (void)
{
int *Array = NULL;
int number;
cout << "生成随机数个数:" ;
cin >> number;
Array = Create_Array (Array, number + 1);
cout << "排序前:" << endl;
Print_Array (Array, number + 1);
cout << endl;
Quick_Sort (Array, 1, number);
cout << "排序后:" << endl;
Print_Array (Array, number + 1);
cout << endl;
return 0;
}
int * Create_Array (int *Array, int num)
{
srand ((unsigned)time (NULL));
Array = new int [num];
Array[0] = MIN;
for (int i = 1; i < num; ++ i)
Array[i] = rand() % 9999 + 1;
return Array;
}
void Print_Array (int *Array, int num)
{
int count = 0;
for (int i = 1; i < num; ++ i)
{
cout << setw(7) << Array[i];
++ count;
if (count % 10 == 0)
cout << endl;
}
}
void Exchange (int *Array, int i, int j)
{
int temp;
temp = Array[i];
Array[i] = Array[j];
Array[j] = temp;
}
int Partition (int *Array, int p, int r)
{
int x = Array[r];
int i = p - 1;
int temp;
for (int j = p; j < r; ++ j)
{
if (Array[j] <= x)
{
++ i;
Exchange (Array, i, j);