#include "../../../include/algorithm/sort/merge.h"

namespace c0ding::algorithm {
  template<class T>
  void merge::sort(std::vector<T>& list) {
    if (list.size() > 1) {
    }
  }

  template<class T>
  void merge::sort_natural(std::vector<T>& list) {
    if (list.size() > 1) {
    }
  }

  template<class T>
  void merge::_merge(std::vector<T>& left, std::vector<T>& right) {
  }

  template<class T>
  std::vector<T> merge::_bitonic(std::vector<T>& list) {

    return std::vector<T>();
  }
}