Select Code to Download

C:\test\C>mergeParts 200000000 200
qsort took 59.047691648 secs for 200 partitions of 200000000 element a
+rray
qsort took 7121.598593905 secs to merge 200 partitions of 200000000 el
+ement array

C:\test>BiDiBubbleSort -N=4                #### 4*3/2 = 6 pairs
...
[ A  C  D<>B  E   ]: comp&swap( 2, 3 ) D < B
[ A  C<>B  D  E   ]: comp&swap( 1, 2 ) C < B
A B C D E

for( p1 = start, p2 = end; p1 < p2; ++p1, --p2 ) if( a[p1] < a[p2] ) s
+wap( p1, p2 ).