Page MenuHomeFreeBSD

Implement mergesort for the FreeBSD kernel.
AbandonedPublic

Authored by hselasky on Feb 5 2016, 8:53 AM.
Tags
None
Referenced Files
F132324511: D5200.id13049.diff
Wed, Oct 15, 10:04 PM
Unknown Object (File)
Mon, Oct 13, 3:54 AM
Unknown Object (File)
Sat, Oct 11, 1:02 AM
Unknown Object (File)
Fri, Oct 10, 8:30 PM
Unknown Object (File)
Fri, Oct 10, 6:14 PM
Unknown Object (File)
Thu, Oct 9, 3:06 PM
Unknown Object (File)
Mon, Oct 6, 2:40 AM
Unknown Object (File)
Fri, Oct 3, 7:23 PM
Subscribers

Details

Summary

The sorting algorithm is optimized to sort a pointer array.

Diff Detail

Repository
rS FreeBSD src repository - subversion
Lint
Lint Skipped
Unit
Tests Skipped

Event Timeline

hselasky retitled this revision from to Implement mergesort for the FreeBSD kernel..
hselasky updated this object.
hselasky edited the test plan for this revision. (Show Details)
hselasky added reviewers: gallatin, gnn.
hselasky set the repository for this revision to rS FreeBSD src repository - subversion.

Re-add sys/conf/files deltas.

Why not just use quicksort?

Because quicksort appears to be unpredictable with regard to how many times the function needs to recurse and how long the sorting can take.

See:
https://en.wikipedia.org/wiki/Quicksort

--HPS