hi William,
William Stacey [C# MVP] schrieb:
But they are already in sorted order, so you they just follow set1, set2,
set3, etc.
When copying each element of each set the queue is sorted. But you need
to compare for each set element to copy.
Using the merge step from the merge sort algorithm, the steps can be
reduced. In the worst case you need the same amount of steps. Generally
you need lesser steps. So it would be faster.
mfG
--stefan <--