Select Code to Download

C:\test>BiDiBubbleSort -N=8
I>H G F E D C B A : comp&swap( 0, 1 ) I < H
...
A B C E F>D G H I : comp&swap( 4, 5 ) F < D
A B C E<D F G H I : comp&swap( 3, 4 ) E < D
A B C D E F G H I

C:\test\C>inPlaceMerge 100000000 2
qsort took 39.071390618 secs for 100000000 element array
qsort took 37.654166926 secs for 2 partitions of 100000000 element arr
+ay
isort took 2.540992389 secs for 2 partitions of 100000000 element arra
+y

C:\test\C>inPlaceMerge 100000000 4
qsort took 39.024688029 secs for 100000000 element array
...
qsort took 38.918586479 secs for 100000000 element array
qsort took 34.792559013 secs for 8 partitions of 100000000 element arr
+ay
isort took 12.882464701 secs for 8 partitions of 100000000 element arr
+ay