Date: Tue, 18 May 2021 11:23:11 +0200 From: Hans Petter Selasky <hps@selasky.org> To: Cyril Zhang <cyril@freebsdfoundation.org>, freebsd-hackers@freebsd.org Subject: Re: patch: Change default sorting algorithm in sort(1) Message-ID: <63875688-33d3-d5a9-008f-4b8f53542434@selasky.org> In-Reply-To: <CAAmMA2gwbTrBqPyFNsEEOixsvUeXj8EUD-pkhUyF9QpYXD9=qw@mail.gmail.com> References: <CAAmMA2gwbTrBqPyFNsEEOixsvUeXj8EUD-pkhUyF9QpYXD9=qw@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On 5/17/21 10:25 PM, Cyril Zhang via freebsd-hackers wrote: > The main consideration is memory usage. The mergesort implementation > in libc allocates extra memory, and in the sort program this amounts > to about n * sizeof(void *) Will this affect small-memory systems ability to sort data? --HPS
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?63875688-33d3-d5a9-008f-4b8f53542434>