Knuth's algorithm S: Difference between revisions
Content added Content deleted
(→{{header|PARI/GP}}: 100,000 times) |
m (→{{header|PARI/GP}}: more idiomatic) |
||
Line 508: | Line 508: | ||
v[t[1]+1]++;v[t[2]+1]++;v[t[3]+1]++ |
v[t[1]+1]++;v[t[2]+1]++;v[t[3]+1]++ |
||
); |
); |
||
v |
|||
for(i=0,9,print(i" "v[i+1])) |
|||
};</lang> |
};</lang> |
||
Output: |
Output: |
||
<pre>%1 = [30067, 30053, 29888, 30161, 30204, 29990, 30175, 29980, 29622, 29860]</pre> |
|||
<pre>0 30048 |
|||
1 29902 |
|||
2 30168 |
|||
3 29950 |
|||
4 30003 |
|||
5 30094 |
|||
6 29905 |
|||
7 30286 |
|||
8 29839 |
|||
9 29805</pre> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |