timealgorithms.h 274 B

123
  1. void InsertionSort(std::vector<int>* numbers, int *comparisonCounter, int *memAccessCounter);
  2. void QuickSort(std::vector<int>* numbers, int *comparisonCounter, int *memAccessCounter);
  3. void MergeSort(std::vector<int>* numbers, int *comparisonCounter, int *memAccessCounter);