{"request":{"endpoint":"https://exercism.org/api/v2/tracks/delphi/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"24848937d8044de58616a4c538ea8b92","snippet":"unit uBinarySearch; interface type BinarySearch = class public class function Search(values: TArray; key: integer): integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":48,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2021-02-14T17:12:56.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"acolburn"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/acolburn","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"b5982d9f54fa447fb3be61d80b195779","snippet":"unit uBinarySearch; interface type BinarySearch = class class function Search(inputList : TArray; value : Integer ) : Integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2018-09-27T01:13:30.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"heptalophos"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/heptalophos","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"55805276db054944abb176a97440d128","snippet":"unit uBinarySearch; interface type BinarySearch = class public class function Search(const Integers:array of Integer; ToSearch:Integer):Integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2023-02-13T15:32:11.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"lucvtzel"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/lucvtzel","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"30d46b95fa794206b9bad9f92330fc34","snippet":"unit uBinarySearch; interface type BinarySearch = class class function Search(ANumbers:TArray; const ANumber:integer):Integer; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":35,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2021-01-08T09:03:00.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"Neftali"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/Neftali","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"bb88a87b19c148d0b35b45df347d641b","snippet":"{ uBinarySearch.pas -- simple binary search } unit uBinarySearch; interface type BinarySearch = class public class function Search(items: array of integer; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":50,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2023-08-18T01:45:31.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"BlameTroi"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/BlameTroi","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"041d5f618a2744b59735a5c4a61d9bfe","snippet":"unit uBinarySearch; interface type TBinarySearch = class // Return the index of the first occurance of Number in Domain, if present, // else return -1. function Search( Domain: TArray; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":33,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2019-10-23T14:48:22.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"Greycoat21"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/Greycoat21","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"4611bcc837b940c18705cb834ce4046f","snippet":"unit uBinarySearch; interface type BinarySearch = class public class function Search(AInput : TArray; AVal : integer) : integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2018-08-27T17:37:36.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"eferim"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/eferim","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"73a1fafb9f774b4e9fc05559550ae3ca","snippet":"unit uBinarySearch; interface type BinarySearch = class(TObject) public class function Search(SortedArray: TArray; SearchKey: Integer): Integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":40,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2021-08-23T13:45:15.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"diegosimonini"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/diegosimonini","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"47afb50ef9574597927131c7e7f99a30","snippet":"unit uBinarySearch; interface uses System.Generics.Collections; type BinarySearch = class class function Search(aArray: TArray; aValue: integer): integer; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"amoradell"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/amoradell","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"698fcfcab82948f894f7b46971fbc977","snippet":"unit uBinarySearch; interface uses System.Generics.Collections; const ValueNotFound = -1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":56,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2020-09-24T15:15:08.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"dgeiger"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/dgeiger","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"94546b5679e041b38f74e23109990fd0","snippet":"unit uBinarySearch; interface uses Generics.Collections; type IBinarySearch = interface function Search(SearchArray: TArray; aValue: Integer): Integer; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":40,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2022-01-01T20:30:27.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"bero"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/bero","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"6a05b8e562a64c3088e2fd13c4e77dd9","snippet":"unit uBinarySearch; interface type BinarySearch = class class function Search(arr: TArray; target: Integer): Integer; static; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2025-05-30T08:26:27.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"martak1"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/martak1","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"903a295aad464e2488fcb57d339d7ffa","snippet":"unit uBinarySearch; interface type TBinarySearch = record function Search(ls: TArray; ans: integer): integer; end; var ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2026-07-08T06:12:08.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Rohankapri"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/Rohankapri","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"98619466d9584be4ab752d3588cc1557","snippet":"unit uBinarySearch; interface type BinarySearch = class strict private class function SearchHelper(input: TArray; target: integer; minIndex: integer; maxIndex: integer): integer; static; public class function Search(input: TArray; target: integer): integer; static; ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2018-08-19T18:20:27.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"rpottsoh"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/rpottsoh","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"4ffe9b946fed4099af87a8a96ca09ce8","snippet":"unit uBinarySearch; interface type BinarySearch = class class function Search(const AValues : TArray; const AKey : integer) : integer; static; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2022-03-11T16:37:48.000Z","is_out_of_date":true,"language":"delphi","author":{"handle":"CorwinStar2021"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/CorwinStar2021","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}},{"uuid":"b246a80fff90456a8e0e5bf0ef0961fb","snippet":"unit uBinarySearch; interface type TBinarySearch = record function Search(ls: TArray; ans: integer): integer; end; var ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2025-09-17T10:24:13.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"yamat0jp"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/solutions/yamat0jp","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":16,"total_pages":1,"unscoped_total":16}}}}}

Мовні треки

Вчимося програмувати з Jiki

Подорож

ОбранеНове

Переваги Exercism

Відео спільноти

Серія коротких вступів

Інтервʼю та історії

Discord

Форум

З чого почати

Наставництво

Документація

Учасники

ПерекладачіНове

Пожертвувати

Про Exercism

Наш вплив

Синхронізатор GitHubНове

Інсайдери