issues
search
Morwenn
/
vergesort
Unstable O(n log n) sorting algorithm with O(n) memory
MIT License
60
stars
6
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Consider using gfx::timmerge instead of std::inplace_merge
#14
vedgy
opened
3 years ago
1
Poor performance compared to cppsort::verge_sort()
#13
andyg24
closed
4 years ago
5
Using vergesort Backed by ska::sort
#12
victorstewart
closed
5 years ago
5
Stable vergesort
#11
Morwenn
opened
6 years ago
1
Sorting ends of Voronoi diagram edges.
#10
tomilov
closed
6 years ago
3
Fix typo
#9
vittorioromeo
closed
7 years ago
1
Add benchmarks to vergesort on top of several sorting algorithms
#8
Morwenn
closed
7 years ago
2
Better handling for descending sequences with plateaux
#7
Morwenn
opened
7 years ago
0
Componentize, update algorithm, update README...
#6
Morwenn
closed
7 years ago
0
Take lessons from WikiSort and QuickXSort
#5
Morwenn
opened
8 years ago
1
Reuse merge memory
#4
Morwenn
opened
8 years ago
1
A smarter merging scheme
#3
Morwenn
closed
7 years ago
3
std::list::sort _is_a_ merge-sort for libstdc++. Why are you seeing different running times?
#2
dhruvbird
closed
9 years ago
2
Use a mergesort-backed introsort for the bidirectional iterators vergesort
#1
Morwenn
opened
9 years ago
0