Список проголосовавших за комментарий "Nearest step: shuffling by weak algorithm<br/> weak randomness is randomness of normal<br/> <br/> Sequence is bad<br/> and inserted into Excel in 2 columns at a distance<br/> and to left end-to-end of 2nd column is a column of numbers in a row<br/> and columns are sorted end to end from maximum to minimum<br/> <br/> Grouped together: reverse and forward sequences<br/> and then sort both by ordering reverse<br/> sequence is shuffled simultaneously. <br/> <br/> test shows normality of a shuffled<br/> sequences of even\odd and large\small<br/> <br/> An automatic algorithm without rnd reads array straight<br/> and immediately there is an array reverse:… it's a computer ...<br/> <br/> Sorting reverse array shuffles forward array<br/> and it turns out sequence is normal<br/> <br/> 'tasov.bas<br/> DIM a(55000), d(55000)<br/> OPEN «aa.txt» FOR INPUT AS #1<br/> OPEN «dd.txt» FOR OUTPUT AS #2<br/> <br/> FOR i = 1 TO 55000<br/> INPUT #1, a(i): d(55000 — i + 1) = a(i):NEXT<br/> <br/> FOR i = 1 TO 54999: FOR j = i TO 55000<br/> IF d(i) > d(j) THEN SWAP d(i), d(j): SWAP a(i), a(j)<br/> NEXT: NEXT<br/> <br/> FOR i = 1 TO 55000: PRINT #2, a(i): NEXT: CLOSE<br/> <br/> <br/> //tasov.cs<br/> using System; using System.Linq;<br/> using System.Collections.Generic;<br/> using System.Text; using System.IO;<br/> namespace tasov<br/> { class Program<br/> { static long[] a; static long[] d;<br/> static void Main(string[] args)<br/> { a = new long[55500]; d = new long[55500];<br/> var inpFile = new StreamReader(«aa.txt»);<br/> for (int i = 1; i <= 55000; i++)<br/> { a[i] = Convert.ToInt64(inpFile.ReadLine());<br/> d[55000-i+1] = a[i]; }<br/> <br/> for (int i = 1; i <= 54999; i++)<br/> for (int j = i; j <= 55000; j++)<br/> if (d[i] > d[j])<br/> { var temp = d[i]; d[i] = d[j]; d[j] = temp;<br/> temp = a[i]; a[i] = a[j]; a[j] = temp; }<br/> <br/> var outFile = new StreamWriter(«vv.txt»);<br/> for (int i = 1; i <= 55000; i++)<br/> outFile.WriteLine(a[i]);<br/> Console.ReadKey();}}}<br/> <br/> "