Time-Complexity-Tests/PrintCommands.cpp at master · canyoucsharp/Time-Complexity-Tests · 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include "Header.h"


void Sorting::Print(int SortIdentifier, int CurrentSize,int Case)
{
	/*
	Sort Identifiers :
	Insertion Sort = 1
	Selection Sort =2
	Bubble Sort =3
	Merge Sort =4
	Quick Sort =5
	Improved bubble = 6
	*/

	//myfile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
	//case,size,steps,time,\n

	switch (SortIdentifier)
	{
	case 1://insertion
		if (!Ins)
			PHead(SortIdentifier);

		 InsertionFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		 break;
	case 2://selection
		if (!Sel)
			PHead(SortIdentifier);

		SelectionFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		break;
	case 3://bubble
		if (!Bub)
			PHead(SortIdentifier);

		BubbleFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		break;
	case 4://merge
		if (!Mer)
			PHead(SortIdentifier);

		MergeFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		break;
	case 5://quick
		if (!Quic)
			PHead(SortIdentifier);

		QuickFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		break;
	case 6://Improved Bubble
		if (!BubI)
			PHead(SortIdentifier);

		BubbleImpFile << Case << "," << CurrentSize << "," << FinCount << "," << FinTime << ",\n";
		break;

	}


}


void Sorting::PHead(int SortIdentifier)
{

	if (SortIdentifier == 1 && Ins == false)
	{
		Ins = true;
		InsertionFile << "Case,Size,Steps,Time,\n";
	}
	else if (SortIdentifier == 2 && Sel == false)
	{
		Sel = true;
		SelectionFile << "Case,Size,Steps,Time,\n";
	}
	else if (SortIdentifier == 3 && Bub == false) {
		Bub = true;
		BubbleFile << "Case,Size,Steps,Time,\n";
	}

	else if (SortIdentifier == 4 && Mer == false) {
		Mer = true;
		MergeFile << "Case,Size,Steps,Time,\n";
	}
	else if (SortIdentifier == 5 && Quic == false) {
		Quic = true;
		QuickFile << "Case,Size,Steps,Time,\n";
	}
	else if (SortIdentifier == 6 && BubI == false) {
		BubI = true;
		BubbleFile << "Case,Size,Steps,Time,\n";
	}
}