****摘要:(1)选择第k小的元素
(2)一个效率一般的方法:对前k个元素进行排序(此处采用冒泡排序,o(k^2))
(3)然后对后N-k个元素逐个插入比较,如果比(2)中序列最大的小,则将其插入合适的位置。
总结:该方法在k=N/2时时间界最差,任然处于O(N^2)的量级。****
*#include "stdafx.h"
*#include "time.h"*
#include<stdlib.h>
#define N 100000*
#define k 10
void insert(int x, int j, int *a)//将x插入第a[j]个//j+1
{
for (int i = 0;i<= j - 1;i++)
{
a[i] = a[i+1];
}
a[j] = x;
}
int _tmain(int argc, _TCHAR* argv[])
{
clock_t start,finish;
// create the array[N] :1-N
int a[N] = {0};
int temp[k] = {0};
for (int i = 0;i<=N-1;i++)
a[i] = i;
start = clock();
// select the k
for (int i =0 ;i<=k-1;i++)
temp[i] = a[i];
//冒泡排序
for (int i = 0;i <=k-1;i++)
{
for (int j = 0;j<=k-2-i;j++)
{
if(temp[j] > temp[j+1])
{
int temp_t = temp[j+1];// 交换
temp[j+1] = temp[j];
temp[j] = temp_t;
}
}
}
// 加入后k元素
for (int i = k;i<= N-1;i++)
{
if (a[i] <=temp[0])
break;
else
{
temp[0] = a[i];
for (int j = 0;j<=k-2;)
{
if(temp[j] > temp[j+1])
{
int t = temp[j+1];
temp[j+1] = temp[j];
temp[j++] = t;
}
else
break;
} //for
}//else
}
finish = clock();
printf("The process use %f seconds", (double)(finish - start)/CLOCKS_PER_SEC);
system("pause");
return 0;
}
选择问题
最新推荐文章于 2021-05-17 21:57:25 发布