Binary search: Difference between revisions

Content added Content deleted

Inline

@@ Line 3,194: / Line 3,194: @@
 =={{header|EasyLang}}==
 <syntaxhighlight lang="text">
-proc bin_search val . a[] res .
+proc binSearch val . a[] res .
-  low = 1
+   low = 1
-  high = len a[]
+   high = len a[]
-  res = 0
+   res = 0
-  while low <= high and res = 0
+   while low <= high and res = 0
-    mid = (low + high) div 2
+      mid = (low + high) div 2
-    if a[mid] > val
+      if a[mid] > val
-      high = mid - 1
+         high = mid - 1
-    elif a[mid] < val
+      elif a[mid] < val
-      low = mid + 1
+         low = mid + 1
-    else
+      else
-      res = mid
+         res = mid
-    .
+      .
-  .
+   .
 .
 a[] = [ 2 4 6 8 9 ]
-call bin_search 8 a[] r
+binSearch 8 a[] r
 print r
 </syntaxhighlight>