Skip to content

Replace word insertion sort with merge sort

The block and page pools only need to be sorted before coalescing them. As insertion sort for linked lists is O(n^2), the runtime may become unbearably slow, while a merge sort at the end will run in O(n log n).

See #1173 (closed)

Merge request reports