Data commit

Task/Binary-search/Pascal/binary-search-1.pas

@@ -0,0 +1,25 @@
+function binary_search(element: real; list: array of real): integer;
+var
+    l, m, h: integer;
+begin
+    l := Low(list);
+    h := High(list);
+    binary_search := -1;
+    while l <= h do
+    begin
+        m := (l + h) div 2;
+        if list[m] > element then
+        begin
+            h := m - 1;
+        end
+        else if list[m] < element then
+        begin
+            l := m + 1;
+        end
+        else
+        begin
+            binary_search := m;
+            break;
+        end;
+    end;
+end;

Task/Binary-search/Pascal/binary-search-2.pas

@@ -0,0 +1,4 @@
+var
+    list: array[0 .. 9] of real;
+// ...
+indexof := binary_search(123, list);