{"request":{"endpoint":"https://exercism.org/api/v2/tracks/odin/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"917da16a6408483087b6f30bd7cca44e","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { left := 0 right := len(haystack) - 1 for left <= right { mid := left + (right-left)/2 if haystack[mid] == needle { return mid, true } else if haystack[mid] < needle { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-04-04T16:41:37.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"kenzanin"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/kenzanin","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"f06e00f70558419998f245355aa2d003","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { n := len(haystack) if (n == 0) do return 0, false left, right := 0, n - 1 for left != right { mid := (left + right) >> 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-12T15:35:50.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"HippasusSurd"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/HippasusSurd","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"51db066165d4492c871a5fc4a6f7bb5b","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { length := len(haystack) start, end := 0, length midx := start + (end - start)/2 for start < end { midx = start + (end - start)/2 if needle == haystack[midx] { return midx, true } else if needle <= haystack[midx] { end = midx ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-09-12T17:41:55.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"jamiedsmith95"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/jamiedsmith95","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"50f66ab50d604cfc86ad80cca17396f5","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { left := 0 right := len(haystack) - 1 for left <= right { middle := (left + right) / 2 switch { case needle < haystack[middle]: right = middle - 1 case needle > haystack[middle]: left = middle + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-15T20:10:35.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"c94e77fc86394a5ab60e8b518589f144","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { if len(haystack) == 0 || needle < haystack[0] { return 0, false } low := 0 high := len(haystack) - 1 for low <= high { mid := low + (high - low) / 2 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-01T08:19:19.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"egriff89"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/egriff89","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"f022414e6c964ac6929d2c3ac669709d","snippet":"find :: proc(list: []$T, key: T) -> (index: int, found: bool) #optional_ok { base, count := 0, len(list) for count > 0 { half := count / 2 mid := base + half is_less_than_key := list[mid] < key base = is_less_than_key ? mid + 1 : base count = is_less_than_key ? count - (half + 1) : half ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":5,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-09-14T12:57:43.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"stuarthighley"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/stuarthighley","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"2fb288ae0b1d41db838d7d8213476ae8","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { l, r := 0, len(haystack) for l < r { m := (l + r) / 2 if haystack[m] >= needle { r = m } else { l = m + 1 } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-08-25T06:59:39.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"hucancode"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/hucancode","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"2cfe0442f1044816b7d770dfa62316b1","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { low, high := 0, len(haystack) - 1 for low <= high { mid := (low + high) / 2 switch { case haystack[mid] == needle: return mid, true case haystack[mid] < needle: low = mid + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-15T05:01:30.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"chatter"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/chatter","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"75d1c7afe9ef413c950a14870979ea83","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { left := 0 right := len(haystack) for left < right { center := (left + right) / 2 if haystack[center] == needle { return center, true } else if needle < haystack[center] { right = center ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-01T16:57:40.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"sezoka"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/sezoka","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"5a11f43070e04dbdbeee9250d5f47bbe","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { low := 0 length := len(haystack) for length > 1 { half := length / 2 low += half * int(haystack[low + half] <= needle) length -= half } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-19T16:43:23.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"david82"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/david82","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"b400437269f842b3af131413042429ec","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { min := 0 max := len(haystack) - 1 mid := 0 for min <= max { mid = (min + max) / 2 if haystack[mid] > needle { max = mid - 1 } else if haystack[mid] < needle { min = mid + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-05-01T13:58:16.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"frederickjeanguerin"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/frederickjeanguerin","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"3856ac1c8c5347adb8a8120051dc7307","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { left := 0 right := len(haystack) - 1 if left > right do return 0, false for left <= right { mid := left + (right - left) / 2 if haystack[mid] == needle { return mid, true } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-08-11T02:11:29.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"insanepupil"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/insanepupil","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}},{"uuid":"8360504a164a46ea96a8e5cfa9d98356","snippet":"find :: proc(haystack: []$T, needle: T) -> (index: int, found: bool) #optional_ok { l, r := -1, len(haystack) for l+1 != r { m := l + (r - l) / 2 if haystack[m] <= needle do l = m else do r = m } if l >= 0 do return l, haystack[l] == needle return -1, false } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-05-25T19:40:38.000Z","is_out_of_date":false,"language":"odin","author":{"handle":"naronov"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Odin","icon_url":"https://assets.exercism.org/assets/graphics/missing-track-e3d861058d4702c1dc4036617689249659b8d37d.svg","highlightjs_language":"odin"},"links":{"public_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/solutions/naronov","private_iterations_url":"https://exercism.org/uk/tracks/odin/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":13,"total_pages":1,"unscoped_total":13}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери