Partition algorithms for the doubly linked list

Abstract

The purpose of this paper is to present partition sort and search algorithms developed by the author for the doubly linked list. First, the binary search concept will be modified to enable its use on a linked list, and the resulting algorithm, (he Blink Search, will be shown to be more than twice as time efficient as the sequential search. The Blink Search will then be used to enhance a standard insertion sort. Upon finding that the improvement still leaves the insertion sort with the unacceptable 0(n^) rating, several linked list partition sorts will be developed. We will see later that the best of these, the Blink Sort, shows very comparable execution lime to the Quicksort on an equivalent array; in fact, the Blink Sort is rated O(nlogn) for random data and 0(n) for reversed order and sorted order lists.