#include<iostream>
#include <time.h>
#include<cstdlib>
#include<ctime>
#define random(x) (rand()%x)
using namespace std;
//double sort
int S[1000000];
int begin;
int end;
void swap(int i, int j){
int temp = S[i];
S[i] = S[j];
S[j] = temp;
}
int sort(int size){
for(int i=1;i<size;i++){
S[i] = random(100);
}
begin = clock();
for(int i=size-1;i>=0;i--){
for(int j=0;j<i;j++){
if(S[j] < S[j+1]){
swap(j,j+1);
}
}
}
end = clock();
return end-begin;
}
int main(){
int n = 5;//experiment times;
cout << "experimenting......" << endl;
int size = 10;
for(int i=0;i<n;i++){
cout <<i<<"experiment... size "<<size<<endl;
sort(size);
size*=10;
cout << end-begin << "/" << CLOCKS_PER_SEC << " (s) "<< endl;
}
}
算法分析作业
最新推荐文章于 2018-12-08 19:29:53 发布