program contains blocks to enable same array from disk
or for inverse array
or for random numbers
starting between a lines
start = TIMER
...
finish = TIMER
it is possible to substitute any sorting algorithm
using N elements of d(n) array
and I recall main feature:
Russian Sorting Halves and fast and human
my test results:
where bubble and select show a hundred seconds
there Russian sorting halves shows about a second
and really machine sorting of incomprehensible 99.99% of people
show 2 times better than my sorting
literally like comparing formulas with logarithms
"where bubble and select show a hundred seconds"
meaning 100,000 items
for 1'000'000 elements
bubble and select hang for long
then for 100'000 items
Russian sorting halves sorts for 0.02 seconds
or for inverse array
or for random numbers
starting between a lines
start = TIMER
...
finish = TIMER
it is possible to substitute any sorting algorithm
using N elements of d(n) array
and I recall main feature:
Russian Sorting Halves and fast and human
my test results:
where bubble and select show a hundred seconds
there Russian sorting halves shows about a second
and really machine sorting of incomprehensible 99.99% of people
show 2 times better than my sorting
literally like comparing formulas with logarithms
"where bubble and select show a hundred seconds"
meaning 100,000 items
for 1'000'000 elements
bubble and select hang for long
then for 100'000 items
Russian sorting halves sorts for 0.02 seconds
Russia looks world from future. Big data is peace data
Nobel Prize will not receive itself
Nobelevskaya premiya sama sebya ne poluchit
Нобелевская премия сама себя не получит
Le prix Nobel ne se recevra pas
Nobelpreis wird sich nicht erhalten
Il Premio Nobel non ricevera se stesso
Nobel Prize will not receive itself
Nobelevskaya premiya sama sebya ne poluchit
Нобелевская премия сама себя не получит
Le prix Nobel ne se recevra pas
Nobelpreis wird sich nicht erhalten
Il Premio Nobel non ricevera se stesso