Date: Thu, 26 May 2016 14:10:59 +0200 From: Ed Schouten <ed@nuxi.nl> To: Hans Petter Selasky <hselasky@freebsd.org> Cc: src-committers <src-committers@freebsd.org>, svn-src-all@freebsd.org, svn-src-head@freebsd.org Subject: Re: svn commit: r300731 - head/sys/netinet Message-ID: <CABh_MK=RKCwUpwuXd5YX0o9OgLUXn3wfVFEhd1f3HQbZyDavew@mail.gmail.com> In-Reply-To: <201605261110.u4QBAW7W099643@repo.freebsd.org> References: <201605261110.u4QBAW7W099643@repo.freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
Hi Hans, 2016-05-26 13:10 GMT+02:00 Hans Petter Selasky <hselasky@freebsd.org>: > Use optimised complexity safe sorting routine instead of the kernel's > "qsort()". Cool! Thanks for working on this! > The custom sorting routine takes advantage of that the sorting key is > only 64 bits. Based on set and cleared bits in the sorting key it > partitions the array until it is sorted. A sorting algorithm that uses such an approach is typically called Radix Sort: https://en.wikipedia.org/wiki/Radix_sort Would it make sense to mention this in the comments, instead of referring to it as a "bit-slice sorter algorithm"? -- Ed Schouten <ed@nuxi.nl> Nuxi, 's-Hertogenbosch, the Netherlands KvK-nr.: 62051717
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?CABh_MK=RKCwUpwuXd5YX0o9OgLUXn3wfVFEhd1f3HQbZyDavew>