mergesort.h 469 B

1234567891011121314151617
  1. // Merge Sort
  2. //
  3. // Author: Rob Gysel
  4. // ECS60, UC Davis
  5. // Adapted from: Lysecky & Vahid "Data Structures Essentials", zyBooks
  6. // include guard
  7. #ifndef MESORT_H
  8. #define MESORT_H
  9. #include <vector>
  10. int* MergeSort(std::vector<int>* numbers);
  11. void MergeSortRecurse(std::vector<int>* numbers, int i, int k, int *comparisonCounter, int *memAccessCounter);
  12. void Merge(std::vector<int>* numbers, int i, int j, int k, int *comparisonCounter, int *memAccessCounter);
  13. #endif