Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

start with insertion sort for better speed

Browse source
This commit is contained in:
Ahmet Inan 2024-03-08 11:01:38 +01:00
commit ac5fc8deea
1 changed files with 4 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

6
sort.hh
View file

@ -34,7 +34,7 @@ static void insertion_sort(INDEX *p, TYPE *a, int n)
} }
} }
template <typename TYPE, int MAX_N> template <typename TYPE, int MAX_N, int M = 32>
class MergeSort class MergeSort
{ {
TYPE tmp[MAX_N]; TYPE tmp[MAX_N];
@ -50,7 +50,9 @@ class MergeSort
public: public:
void operator()(TYPE *a, int n) void operator()(TYPE *a, int n)
{ {
for (int l = 1; l < n; l *= 2) { for (int i = 0; i < n; i += M)
insertion_sort(a+i, i > n-M ? n-i : M);
for (int l = M; l < n; l *= 2) {
for (int i = 0; i < n; i += 2*l) for (int i = 0; i < n; i += 2*l)
merge(a, n, i, i+l, i+2*l); merge(a, n, i, i+l, i+2*l);
for (int i = 0; i < n; ++i) for (int i = 0; i < n; ++i)