[PATCH] SLIST mergesort implementation

This is an implementation of the merge sort algorithm for SLIST in queue(3). Merge sort is a stable algorithm that provides us a worst case run time of O(n lg n) and uses at most O(n) of stack (where 'n' is the current number of elements in the list). The patch attached to this mail provides the

Re: [PATCH] SLIST mergesort implementation

This is an implementation of the merge sort algorithm for SLIST in queue(3). Sorting is something you do in an algorithm when you need it, specific to that algorithm, exactly where you need it. queue.h is supposed to be a minimal API, general access so that the specifics remain in the code