?? mergesort.cpp
字號:
#include"iostream.h"
static unsigned int RAND_SEED=1;
unsigned int random(void)//產生隨機數
{
RAND_SEED=(RAND_SEED*123+59)%65536;
return(RAND_SEED);
}
void random_start(int xxx)//初始種子
{
RAND_SEED=xxx;
}
int *onerange(int n) //產生隨機序列
{
int i;
int *d = new int[n];
int *range=new int[n];
int seed=0;
unsigned int a;
for (i=0; i<n; i++)
{
*(d+i) = i+1;
}
for (i=0; i<n;)
{
random_start(seed);
a=random();
seed=a;
a %= n;
if (*(d+a)!=-1)
{
range[i]=*(d+a);//cout<<*(d+a)<<"\t";
*(d+a) = -1;
i++;
}
}
delete d;
return range;
}
void merge(int c[], int d[], int l, int m, int r){
//合并c[l:m]和c[m+1:r]到d[l:r]
int i = l;
int j = m+1;
int k = l;
while((i <= m) && (j <= r)){
if(c[i] < c[j])
d[k++] = c[i++];
else
d[k++] = c[j++];
}
if(i > m){
for(; j <= r;)
d[k++] = c[j++];
}
else{
for(; i <= m;)
d[k++] = c[i++];
}
}
void mergeSort(int a[], int n, int left, int right){
if(left<right){
int i = (left + right)/2;
mergeSort(a, n, left, i);
mergeSort(a, n, i+1, right);
int *b=new int[n];
merge(a, b, left, i, right);
int j;
for(j = left; j <= right; j++){
a[j] = b[j];
}
delete []b;
}
}
void main()
{
int n=50;
int *p=onerange(n);
mergeSort(p,n,0,n-1);
for(int i=0;i<n;i++)
cout<<p[i]<<endl;
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -