比较 N个元素一个一个地插入到一个堆中以线性时间建立一个堆已排序、反序、随机输入的运行时间

最新推荐文章于 2024-08-15 19:32:27 发布

qq789045

最新推荐文章于 2024-08-15 19:32:27 发布

阅读量1.4k

点赞数 3

分类专栏：数据结构与算法分析——c语言描述答案

本文链接：https://blog.csdn.net/qq789045/article/details/51527323

版权

数据结构与算法分析——c语言描述答案专栏收录该内容

111 篇文章 119 订阅

订阅专栏

根据《数据结构与算法分析——c语言描述》中的练习6.11，比较了直接一次性构建堆（O(N)复杂度）与逐个插入元素到堆中（N次O(logN)复杂度）的方法。实验结果显示，两种方法在已排序、反序和随机输入的情况下运行时间差距显著，可达两倍之多。

摘要由CSDN通过智能技术生成

《数据结构与算法分析——c语言描述》练习6.11 答案

性能竟然相差两倍。buildheap复杂度是O(N),n次insert是O(NlogN)

#include"binheap.h"
#include<stdlib.h>
#include<stdio.h>
#include<time.h>
#define N 9999999

int RandInt(int i, int j) {
	int temp;
	temp = (int)(i + (1.0*rand() / RAND_MAX)*(j - i));
	return temp;
}

void getRandomInt(int *A, int n) {
	for (int i = 0; i < n; i++) {
		A[i] = i + 1;
	}

	for (int i = 1; i < n; i++) {
		//std::swap(A[i], A[RandInt(0, i)]);  
		int randAdrr = RandInt(0, i);
		int t = A[i];
		A[i] = A[randAdrr];
		A[randAdrr] = t;
	}
}

int randArr[N];
int proper[N];
int reverse[N];

int main() {
	
	getRandomInt(randArr, N);
	
	for (int i = 0; i < N; i++)
		proper[i] = i+1;
	
	for (int i = N - 1; i >= 0; i--)
		reverse[i] = i + 1;

	printf("rand:\n");
	clock_t t1 = clock();
	PriorityQueue h = initialize(N);
	for (int i = 0; i < N; i++) {
		insert(randArr[i], h);
	}
	clock_t t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);


	t1 = clock();
	h = buildHeap(randArr, N);
	t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);



	printf("proper:\n");
	 t1 = clock();
	h = initialize(N);
	for (int i = 0; i < N; i++) {
		insert(proper[i], h);
	}
	 t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);

	t1 = clock();
	h = buildHeap(proper, N);
	t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);

	printf("reverse:\n");
	t1 = clock();
	h = initialize(N);
	for (int i = 0; i < N; i++) {
		insert(reverse[i], h);
	}
	t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);

	t1 = clock();
	h = buildHeap(reverse, N);
	t2 = clock();
	printf("%f\n", ((double)t2 - t1) / CLOCKS_PER_SEC);
	destroy(h);
}