From 054a2b84eb5fe6e5c08435e0936cc046db8e63ec Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Wed, 5 Sep 2007 20:10:16 +0200 Subject: [PATCH] We don't need this as 2-way merging is used rarely. --- lib/sorter/TODO | 1 - 1 file changed, 1 deletion(-) diff --git a/lib/sorter/TODO b/lib/sorter/TODO index 207eefa2..f4a802ca 100644 --- a/lib/sorter/TODO +++ b/lib/sorter/TODO @@ -8,7 +8,6 @@ o Use radix-sort for internal sorting. o Parallelization of internal sorting. o Clean up data types and make sure they cannot overflow. (size_t vs. u64 vs. sh_off_t vs. uns) o Switching between direct and normal I/O. -o When merging, choose the output file with less runs instead of always switching? o Deal with too rough range estimates in radix splitting. o How does the speed of radix splitting decrease with increasing number of hash bits? Does it help to use more bits than we need, so that we sort less data in memory? -- 2.39.2