DataStructuresAnalysis/setTest.h at master · saksenasonali/DataStructuresAnalysis · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// This file tests the generated input by implementing it in the Set defined in the Standard Template Library.

#include <iostream>
#include <set>
#include <ctime>

using namespace std;

void setTest(int inp[], int count_add, int count_search, int count_del)
{
	set <int> mySet;

	clock_t t1 = clock();

	for(int i=0; i< count_add ;i++)
		mySet.insert(inp[i]);

	clock_t t2 = clock();

	for(int i=0; i< count_search; i++)
	{
		int ans = mySet.count(inp[count_add + i]);
		if( ans==0)
		{
			//cout<<"NO"<<endl;
		}
		else
		{
			//cout<<"YES"<<endl;
		}
	}

	clock_t t3 = clock();

	for(int i =0; i< count_del;i++)
	{
		mySet.erase(inp[count_add + count_search + i]);
	}

	clock_t t4 = clock();

	cout << "\nSet STL done! The result times(in microseconds are) : \n";
	cout << "Inserting " << count_add << " values : " << float(t2-t1)  << "\n";
	cout << "Searching " << count_search << " values : " << float(t3-t2)  << "\n";
	cout << "Deleting " << count_del << " values : " << float(t4-t3)  << "\n";


}