容器的分类与各种测试（一）

#include<iostream>
#include<cstdlib>
#include<ctime>
#include<array>
#include<string>
using namespace std;

#define ASIZE 500000L



long get_a_target_long()
{
	long target = 0;
	cout<<"target(0~"<<RAND_MAX<<"):";
	cin>>target;
	return target;
}
string get_a_target_string()
{
	long target = 0;
	char buf[10];
	cout<<"target(0~"<<RAND_MAX<<"):";
	cin>>target;
	snprintf(buf, 10, "%ld", target);
	return string(buf);
}
int compareLongs(const void* a, const void* b)
{
	return (*(long*)a - *(long*)b);
}

int compareStrings(const void *a, const void *b)
{
	if(*(string*)a > *(string*)b)
		return 1;
	else if(*(string*)a < *(string*)b)
		return -1;
	else
		return 0;
}

void test_array()
{
	cout<<"\ntest_attay.........\n";
	array<long, ASIZE> c;
	clock_t timeStart = clock();
	for(long i=0; i<ASIZE; ++i)
		c[i] = rand();

	cout << "milli-seconds : " << (clock()-timeStart) << endl;	//对ASIZE个元素赋值需要的时间
	cout << "array.size()= " << c.size() << endl;		//数组大小
	cout << "array.front()= " << c.front() << endl;	//获得数组第一个元素
	cout << "array.back()= " << c.back() << endl;	//获得数组最后一个元素
	cout << "array.data()= " << c.data() << endl;	//获得数组在内存中的起点地址

	long target = get_a_target_long();

	timeStart = clock();//取程序开始到当前运行的毫秒数(ms)
	qsort(c.data(), ASIZE, sizeof(long), compareLongs);//C语言函数快速排序
	cout << "qsort(), milli-seconds : " << (clock()-timeStart) << endl;	//排序花费的时间    
	long* pItem = (long*)bsearch(&target, (c.data()), ASIZE, sizeof(long), compareLongs); //二分查找
	cout << "qsort()+bsearch(), milli-seconds : " << (clock()-timeStart) << endl;//排序和查找总用时（ms）    
	if (pItem != NULL)
		cout << "found, " << *pItem << endl;
	else
		cout << "not found! " << endl;	
}
int main()
{
	test_array();
	return 0;
}