Each node can be added to unlimitednumber of ordered lists
(simultaneous sort by different parameters)

As every insertion sort it is stable - it retains the original ordering of
identical keys

It is in-place algorithm - no additional memory or stack is required

Data can be linked in simple as well as double-linked list

Efficient memory usage : only several bytes for 'Next' object are required in
user class

Concept:

HybridList algorithm uses additional auxiliary nodes (green
rectangles) that form some kind of hierarchy over linear chain of user nodes with
actual data (blue circles). This hierarchy or tree of auxiliary nodes makes possible to
find any user node in a sequence only in O (lg N) steps. This means that list with
1,000,000 nodes will work only 2 times slower than list with 1,000 nodes.

Interface description:

Download:

Download trial version to test speed, reliability and interface suitability. Trial
version can not be used for commercial purposes.
When using trial version class names of your nodes should begin with "Unlicensed",
other names will not be accepted.
There are no other limitations for trial version.