Yaroslavskiys Quick Sort Algorithm

I am working on double quick sort. I found here (page number 20 in the slide)

Comparisons:

Yaroslavsky needs an average of 1.9 n ln n.

Classic Quicksort queries = 2 n ln n comparisons!

swaps:

Swaps for the Yaroslavl algorithm = 0.6 n ln n

Swaps for Classic Quicksort = 0.3 n ln n

results

Data Type ----- comp ------- swap

int ------------- 591ns --------- 802ns

bobber ----------- 838ns ---------- 873ns

double ------- 873ns ---------- 1047ns

char ---------- 593ns ----------- 837ns

/ * Note: - above results in nanoseconds and is executed in java lang using intel core 2 duo * /

, Quicksort Yaroslavskiy Quicksort , swap, 88 . 1.9 n ln n, swap .

, java Yaroslavskiy Quicksort? - , ?