dsap.sorting

package documentation

Code from the chapter "Sorting and Selection".

Module	`decorated_merge_sort`	Provides a demonstration of the decorate-sort-undecorate pattern as a decorated_merge_sort function.
Module	`merge_array`	Provides recursive merge-sort implementation for array-based sequence, in form of merge_sort function and merge utility function.
Module	`merge_nonrecur`	Provides bottom-up iterative merge-sort implementation as merge_sort function and merge utility function.
Module	`merge_queue`	Provides bottom-up iterative merge-sort implementation for elements from a queue.
Module	`quick_inplace`	Provides in-place implementation of quick-sort for elements in an array-based sequence.
Module	`quick_queue`	Provides the quick_sort function implementing quick-sort on elements from a FIFO queue.
Module	`quick_select`	Provides the quick_select function to perform randomized selection in linear time.