If two numbers are equal and the relative positions are not changed after sorting, we think the sorting algorithm is stable. Stable sort algorithm: bubble sort, insert sort and merge sort. Unstable sort algorithm: quick sort, heap sort. Introduce an unstable sort algorithm quick sort. Its core thought is divide Read more…
Simple Unit Test Project Let’s create a new unit test project firstly. Write our test functions in feild private Q_SLOTS for the class. tst_string.cpp: #include <QString> #include <QtTest> class String : public QObject { Q_OBJECT public: String(); private Q_SLOTS: void toUpper(); }; String::String() { } void String::toUpper() { QVERIFY2(true, “Failure”); Read more…
accumulate Interval algorithm accumulate supports custom calculate method to count elemeints in the special range. We can use it to get summary, multiple, average and etc of some elements, it’s very convenient and powerful. The syntax and usage example are in the following. Syntax: template< class InputIt, class T > Read more…
count STL algorithm count can help us to count the elements that are equal to value.Its syntax is like the following form: C++ template typename iterator_traits::difference_type count( InputIt first, InputIt last, const T &value ); Example: C++ #include #include #include using namespace std; int main(int argc, char *argv[]) { vector Read more…