| 摘要 |
A method is provided for performing a weak sort on a data structure comprising a plurality of list elements, the elements being associated with data values. The linked list data structure can have a head element containing a comparatively lower data value and a tail element containing a comparatively higher data value. One operation is identifying the head element and tail element of the data structure. The method can also include the operation of calculating a weighted mean value of the data values of the head and tail elements. A further operation can be inserting a new list element into the data structure, the location of the insertion in the data structure being dependent upon the data value of the new element as compared to the weighted mean value.
|
