2021-05-24 16:11:33 +00:00
|
|
|
/*#############################################################################
|
|
|
|
|
## Author: Shaun Reed ##
|
2022-03-31 20:01:08 +00:00
|
|
|
## Legal: All Content (c) 2022 Shaun Reed, all rights reserved ##
|
2021-05-24 16:11:33 +00:00
|
|
|
## About: An example implementation of merge sort using a custom library ##
|
|
|
|
|
## ##
|
|
|
|
|
## Contact: shaunrd0@gmail.com | URL: www.shaunreed.com | GitHub: shaunrd0 ##
|
|
|
|
|
###############################################################################
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef LIB_MERGE_H
|
|
|
|
|
#define LIB_MERGE_H
|
|
|
|
|
|
|
|
|
|
#define ARRAY_LENGTH 10
|
|
|
|
|
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
|
|
void MergeSort(std::vector<int> &array, size_t lhs, size_t rhs);
|
|
|
|
|
|
|
|
|
|
void Merge(std::vector<int> &array, size_t lhs, size_t mid, size_t rhs);
|
|
|
|
|
|
|
|
|
|
#endif // LIB_MERGE_H
|
