QuickSort on linked list

[uydf]

hey, can someone help me with this problem-
if every time K pivots are chosen and every pivot gets a linked list attached to it, with the numbers that are between this pivot and the next, and we do this QS on those linked list again and again. how can I prove that this algorithm CAN'T be better than the usual QuickSort?

[shabinesh]

can you better explain your algorithm. i am lot confused with it :-)