-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.cpp
More file actions
114 lines (88 loc) · 2.01 KB
/
test.cpp
File metadata and controls
114 lines (88 loc) · 2.01 KB
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <QTest>
#include "selectionsort.h"
#include "bubblesort.h"
#include "insertionsort.h"
#include "mergesort.h"
#include "quicksort.h"
class TestAlgorithms : public QObject
{
Q_OBJECT
private:
void sortingTestData();
private slots:
void selectionSort();
void selectionSort_data();
void bubbleSort();
void bubbleSort_data();
void insertionSort();
void insertionSort_data();
void mergeSort();
void mergeSort_data();
void quickSort();
void quickSort_data();
};
void TestAlgorithms::sortingTestData()
{
QTest::addColumn<QVector<int>>("unsorted");
QTest::addColumn<QVector<int>>("sorted");
QVector<int> us = {3,1,8,4,2};
QVector<int> s = {1,2,3,4,8};
QTest::newRow("1") << us << s;
}
void TestAlgorithms::selectionSort_data()
{
sortingTestData();
}
void TestAlgorithms::selectionSort()
{
QFETCH(QVector<int>, unsorted);
QFETCH(QVector<int>, sorted);
Sort::selectionSort(unsorted);
QCOMPARE(unsorted, sorted);
}
void TestAlgorithms::bubbleSort_data()
{
sortingTestData();
}
void TestAlgorithms::bubbleSort()
{
QFETCH(QVector<int>, unsorted);
QFETCH(QVector<int>, sorted);
Sort::bubbleSort(unsorted);
QCOMPARE(unsorted, sorted);
}
void TestAlgorithms::insertionSort_data()
{
sortingTestData();
}
void TestAlgorithms::insertionSort()
{
QFETCH(QVector<int>, unsorted);
QFETCH(QVector<int>, sorted);
Sort::InsertionSort(unsorted);
QCOMPARE(unsorted, sorted);
}
void TestAlgorithms::mergeSort_data()
{
sortingTestData();
}
void TestAlgorithms::mergeSort()
{
QFETCH(QVector<int>, unsorted);
QFETCH(QVector<int>, sorted);
Sort::mergeSort(unsorted);
QCOMPARE(unsorted, sorted);
}
void TestAlgorithms::quickSort_data()
{
sortingTestData();
}
void TestAlgorithms::quickSort()
{
QFETCH(QVector<int>, unsorted);
QFETCH(QVector<int>, sorted);
Sort::quickSort(unsorted.begin(), unsorted.end());
QCOMPARE(unsorted, sorted);
}
QTEST_GUILESS_MAIN(TestAlgorithms)
#include "test.moc"