#include "SortingMachine.h" SortingMachine::SortingMachine(int len) { m_data=new int[len]; m_len=len; } SortingMachine::~SortingMachine() { delete[] m_data; for (vector::const_iterator i = first(); i != last(); i++) { delete (*i); } return; } void SortingMachine::randomData() { for (int i=0; irun(); } void SortingMachine::sortResults() { unsigned N=m_tests.size(); for(unsigned i = 0; i < (N-1); i++) { for(unsigned j = (N-1); j >= 1+i; j--) { if(m_tests[j]->getTime() < m_tests[j-1]->getTime()) { SortTest *x = m_tests[j]; m_tests[j] = m_tests[j-1]; m_tests[j-1] = x; } } } } vector::const_iterator SortingMachine::first() const { return m_tests.cbegin(); } vector::const_iterator SortingMachine::last() const { return m_tests.cend(); }