/quick_merge_sort

Unstable comparison sort for bidirectional iterators in O(n log n) time & O(1) space

Primary LanguageC++OtherNOASSERTION

Quick Merge Sort

Unstable comparison sort for bidirectional iterators in O(n log n) time & O(1) space

Get Started

#include "quick_merge_sort.h++"
#include <iostream>
#include <vector>

int main(){
    vector<int> a{5,6,3,2,3,54,234,5,52,5,52512};
    qmsort::quick_merge_sort(a.begin(), a.end());
    for(auto p: a) cout<<p<<" ";
    return 0;
}