O(N) = 3*N*LOG(N;2)

requires recalculation of entire array

and further distribution of entire array

and further return of sub-array back are required.

and number of distributions takes into account division by halves.

proves visualization and counters.

O(N) = 3*N*LOG(N;2)

Currently 8 options are created

Russian sorting halves:

1. Acceleration of bubble sorting by 2 times

adding a few lines code by dividing array into 2 parts

2. Acceleration of bubble sorting 4 times

adding a few lines code by dividing array into 4 parts

3. Acceleration of selection sorting by 2 times

adding a few lines code by dividing array into 2 parts

4. Acceleration of selection sorting by 4 times

adding a few lines code by dividing array into 4 parts

5. Recursive version of QB64 1'000'000 in 2.2 seconds

6. Recursive version of PureBasic 1'000'000 in 0.3 seconds

7. Excel animation version for 250 items on 150 second

8. Excel fast version for 250 items on 5 second

Russian Sorting Halves and risk management:

in 1st approximation relative to risk of 50%:

to left events with minimal risk for large participation

to right of event with maximum risk for small participation

and still easy to sort inside 2 parts

at least dividing risks into 4 parts.

Russian Sort Halves Accelerate Danilin visualisation

https://www.youtube.com/watch?v=TcwY8Ue0DKw