Binary search: Difference between revisions
→{{header|Quackery}}: improved flattening a nest from O(n^2) to O(log n)
(Added Quackery) |
(→{{header|Quackery}}: improved flattening a nest from O(n^2) to O(log n)) |
||
Line 5,497:
=={{header|Quackery}}==
Written from pseudocode for rightmost insertion point, iterative
<lang Quackery> [ stack ] is value.bs ( --> n )
[ stack ] is nest.bs ( --> n )
[ value.bs put
Line 5,510:
value.bs share > iff
[ 1 - unrot nip ]
drop
value.bs take =
[ dup echo
▲ [ say " was identified at" ]
else
[ say "
echo say "." cr ] is task ( [ n --> n )</lang>▼
▲ echo say "." cr ] is task ( [ n --> n )</lang>
{{out}}
Testing in the shell.
<pre>/O> ' [ 10 20 30 40 50 60 70 80 90 ] 30 task
... ' [ 10 20 30 40 50 60 70 80 90 ] 66 task
...
30 was identified
66
Stack empty.</pre>
| |||