Binary search: Difference between revisions

Content added Content deleted

Inline

@@ Line 5,499: / Line 5,499: @@
 Written from pseudocode for rightmost insertion point, iterative.
-<lang Quackery>  [ stack ]                   is value.bs     (     --> n   )
+<lang Quackery>  [ stack ]                   is value.bs    (         --> n   )
-  [ stack ]                   is nest.bs      (     --> n   )
+  [ stack ]                   is nest.bs     (         --> n   )
+  [ stack ]                   is test.bs     (         --> n   )
-  [ value.bs put
+  [ ]'[ test.bs put
-    dup nest.bs put
+    value.bs put
-    size 1 - 0
+    nest.bs put
+    swap
     [ 2dup < if done
 dup + 1 >>
       nest.bs share over peek
-      value.bs share > iff
+      value.bs share swap
+      test.bs share do iff
         [ 1 - unrot nip ]
         again
       [ 1+ nip ] again ]
     drop
     nest.bs take over peek
-    value.bs take =
+    value.bs take 2dup swap
+    test.bs share do
-    dup dip [ not + ] ]       is binarysearch ( [ n --> n b )
+    dip [ test.bs take do ]
+    or not
+    dup dip [ not + ] ]       is bsearchwith ( n n [ n --> n b )
   [ dup echo
+    over size 1 - 0 swap 2swap
-    binarysearch iff
+    bsearchwith < iff
       [ say " was identified as item " ]
     else
       [ say " could go into position " ]
     echo
-    say "." cr ]              is task         ( [ n --> n   )</lang>
+    say "." cr ]              is task        (     [ n --> n   )</lang>
 {{out}}