请问下面的程序哪里有问题 ?

[guyanhun]

#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <stdlib.h>
#include <ctime>
using namespace std;

template <class T>
void arrayinsert(T a[],T collection[],int size)
{
for(int i=0;i<size;i++)
a[i]=collection[i];
}
template <class T>
void vectorinstert( vector <T>* a,T *collection,int size)
{
for(int i=0;i<size;i++)
a->push_back(collection[i]);
}
template <class T>
void listinsert(list <T>* a,T *collection,int size)
{
for(int i=0;i<size;i++)
a->push_back(collection[i]);
}
template <class T>
void multisetinsert(multiset <T>* a,T *collection,int size)
{
for(int i=0;i<size;i++)
a->insert(collection[i]);
}
/*int *getIntData(int size)
{
int *data=new int [size];
generate(&data[0],&data[size],rand);
return data;
}*/
template <class T>
void getdata(T *data, int size)
{
srand(unsigned (0));
for(int i=0;i<size;i++)
data[i]=rand()%100;
}
void costtime()
{
time_t start,end;
time(&start);
// ...
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
}

int main()
{

int b[1000000],collection[1000000];
getdata(collection,1000000);
time_t start,end;
time(&start);
arrayinsert(b,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
vector <int>a[1000000];
time(&start);
vectorinstert(a,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
list <int>c[1000000];
time(&start);
listinsert(c,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
multiset <int>d[1000000];
time(&start);
multisetinsert(d,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
return 0;
}

[guyanhun]

谢谢...

[jixingzhong]

你是什么问题也不说下 我这里没有编译器啊~

郁闷 在网吧

[jixingzhong]

vector <int>a[1000000]; .......

[zhouhuahai]

int b[1000000],collection[1000000];

stack overflow,你不用数组,改用指针试试.

[junguo]

堆栈溢出啊！你的数组分配的也太大了，这样的情况应该通过操作系统提供的虚拟内存来解决！

[guyanhun]

程序运行就出错了,看来是stack overflow 了.
改小了数字就行了.

[zhouhuahai]

#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <stdlib.h>
#include <ctime>
using namespace std;

template <class T>
void arrayinsert(T a[],T collection[],int size)
{
for(int i=0;i<size;i++)
a[i]=collection[i];
}
template <class T>
void vectorinstert( vector <T> a,T *collection,int size)
{
for(int i=0;i<size;i++)
a.push_back(collection[i]);
}
template <class T>
void listinsert(list <T> a,T *collection,int size)
{
for(int i=0;i<size;i++)
a.push_back(collection[i]);
}
template <class T>
void multisetinsert(multiset <T> a,T *collection,int size)
{
for(int i=0;i<size;i++)
a.insert(collection[i]);
}
/*int *getIntData(int size)
{
int *data=new int [size];
generate(&data[0],&data[size],rand);
return data;
}*/
template <class T>
void getdata(T *data, int size)
{
srand(unsigned (0));
for(int i=0;i<size;i++)
data[i]=rand()%100;
}
void costtime()
{
time_t start,end;
time(&start);
// ...
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
}

int main()
{

//int b[1000000],collection[1000000];
int *b = new int[1000000];
int *collection = new int [1000000];
if(b == NULL || collection == NULL)
{
cout<<"overflow"<<endl;
exit(1);
}
getdata(collection,1000000);
time_t start,end;
time(&start);
arrayinsert(b,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
vector <int>a;
time(&start);
vectorinstert(a,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
list <int>c;
time(&start);
listinsert(c,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
multiset <int>d;
time(&start);
multisetinsert(d,collection,1000000);
time(&end);
cout<<"costing time "<<(end-start)*CLOCKS_PER_SEC<<"ms..."<<endl;
system("pause");
return 0;
}

[zhouhuahai]

这么快就结了?
你的问题在于vector<int> a[1000000];
你的函数只是把他当作一个vector来用,却声明了一个有1000000个vector的数组!!!
造成stack overflow!