we read: "nothing over QSort"
fuller: "nothing over QSort is understandable <1% of people"
about excess, many ask and answer in inverse problem:
? what should be data and in what quantity to exceed limits?
about strings: there is a working prototype
sorting lines applying concept of "integral of letters"
yes I come back to bubble comparisons
to form a clear answer for everyone:
at schools they study bubble and do not study qsort
therefore Russian sorting halves
accelerating bubble 2 times addition
multiple lines in program should be claimed
summa
=0:
FOR i
=1 TO n: summa
=summa
+d
(i
):
NEXT: middle
=summa
/n: y
=1: z
=0IF d
(i
) < middle
THEN a
(y
)=d
(i
): y
=y
+1:
ELSE a
(n
-z
)=d
(i
): z
=z
+1
[ You are not allowed to view this attachment ]
Z = N*(N-1)/2
Z = 2*(N/2*(N/2-1)/2+2*N/2)
Z = 4*(N/4*(N/4-1)/2+2*N/4)
Z = log(N;2)*(N/log(N;2)*(N/log(N;2)-1)/2+2*N/log(N;2))
Currently 13 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
[ You are not allowed to view this attachment ]
5. Recursive of QB64 1'000'000 in 2.2 seconds
6. Recursive of PureBasic 1'000'000 in 0.3 seconds
7. Recursive of FreeBasic 1'000'000 in 0.15 seconds
8. Excel fast for 250 items on 5 second
9. Excel animation for 250 items on 150 second
10. Recursive of C# Csharp 1'000'000 in 0.2 seconds
11. QB64 sorting integral of letters
12. Acceleration of bubble sorting
by dividing into 4 parts C# Csharp
13. Nested loops and indexes of indexes
