{"request":{"endpoint":"https://exercism.org/api/v2/tracks/reasonml/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"f366269aab554a0994d001db748464e5","snippet":"let find = (array, int) => { let rec finder = (imin, imax) => { (imin > imax) ? None : { let imid = (imin + imax) / 2; let midval = array[imid]; switch (midval < int, midval == int, midval > int) { | (true, false, false) => finder(imid + 1, imax) | (false, true, false) => Some(imid) | (false, false, true) => finder(imin, imid - 1) | _ => None ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-15T01:19:41.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"DanCouper"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/DanCouper","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"7e8a055dd5be4a92abd8b86af38858bf","snippet":"let rec aux = (lo, hi, numbers, target) => { let mid = (hi + lo) / 2; if (hi <= lo) { None; } else if (target == numbers[mid]) { Some(mid); } else if (target < numbers[mid]) { aux(lo, mid, numbers, target); } else { aux(mid + 1, hi, numbers, target); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-21T14:19:42.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"menketechnologies"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/menketechnologies","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"44ac4ef8623e4d10825abb554a34e5e2","snippet":"let find = (nums, num) => { let rec helper = (~lo, ~hi) => { let mid = (lo + hi) / 2; switch (nums) { | _ when lo >= hi => None | _ when nums[mid] == num => Some(mid) | _ when num < nums[mid] => helper(~lo, ~hi=mid) | _ when nums[mid] < num => helper(~lo=mid + 1, ~hi) | _ => None ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-08-23T10:09:03.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"naartjie"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/naartjie","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"73660e3321ce4c6d9884e08dc7318484","snippet":"let find = (xs, target) => { let rec aux = (low: int, high: int): option(int) => { if (low >= high) { None } else { let middleIndex = (high - low) / 2 + low; let middle = Array.get(xs, middleIndex); if (target == middle) { Some(middleIndex) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-10-06T05:52:57.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"mbraak"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/mbraak","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"72b902f9241b4482b21fe9945c0c9ba7","snippet":"let rec binarySearch = (a: array(int), i: int, b: int, e: int): option(int) => { let middleIndex = b + (e - b) / 2; let middle = a[middleIndex]; if (middle == i) { Some(middleIndex); } else if (b == e) { None; } else if (middle > i) { binarySearch(a, i, b, middleIndex); } else { ","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":"2019-03-20T13:14:35.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"janfabian"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/janfabian","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"ced206c569474a80b638a3a865974358","snippet":"exception Found(int); let find = (arr, target) => { let left = ref(0); let right = ref(Array.length(arr) - 1); let answer = ref(None); try( while (left^ <= right^) { let mid = left^ + (right^ - left^) / 2; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-27T17:17:44.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"anler"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/anler","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"49d6693463cc4a8d8dd0bbea16489d8c","snippet":"open Belt; let find = (xs, n) => { let rec aux = (start, stop) => if (stop < start) { None; } else { let mediumPoint = (start + stop) / 2; let mediumElem = xs[mediumPoint]; ","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":"2020-09-17T19:53:27.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"hss-mateus"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/hss-mateus","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"1bcd0bef4d1341a6a3185d1c1224a73f","snippet":"let find: (array(int), int) => option(int) = (lst, v) => { let rec aux = (lhi, rhi) => { if(rhi < lhi) { None } else { let mid = (lhi + rhi) / 2; switch(lst[mid]) { | mv when v < mv => aux(lhi, mid-1) | mv when mv < v => aux(mid+1, rhi) | _ => Some(mid) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-05T15:30:39.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"ar90n"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/ar90n","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"ae53f61c5fde4c6291576d3cef044cb9","snippet":"let find = (numbers, needle) => { let len = Array.length(numbers); let safeGetByIndex = (arr, idx) => try(Some(arr[idx])) { | Invalid_argument(_) => None }; let rec inner = (numbers, needle, offset): option(int) => { let len = Array.length(numbers); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-03T14:50:24.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"kevgathuku"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/kevgathuku","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"4e76be83c8574301a13d4fd7b4c310b0","snippet":"let rec find: (array(int), int) => option(int) = (array, num) => { let length = Js.Array.length(array); if(length == 0) { None } else if(length == 1) { (array[0] == num) ? Some(0) : None } else { let pivot = length / 2; let value = array[pivot]; if(value == num) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-08-16T02:54:26.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"wvauclain"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/wvauclain","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"2e2a1c2b7a584bb193e55ca19c6489ac","snippet":"let find = (a: array(int), i: int): option(int) => { let rec binarySearch = (~array, ~int, ~leftIndex=?, ~rightIndex=?, ()) => { let l = switch (leftIndex) { | None => 0 | Some(idx) => idx }; let r = switch (rightIndex) { | None => Js.Array.length(array) - 1 | Some(idx) => idx ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-09-18T10:24:26.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"chbardamu"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/chbardamu","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"da567a4a2cff401da42f1973d78f0543","snippet":"let find = (array: array(int), target: int): option(int) => { let rec subfind = (left, right) => { let middle = (right - 1 - left) / 2 + left; if (right <= left) { None; } else if (array[middle] == target) { Some(middle); } else if (target < array[middle]) { subfind(left, middle); } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-17T05:30:52.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"petertseng"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/petertseng","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"94339181b5a3490ba3f26f15ff5bfacc","snippet":"let rec findIndex = (numbers, num, startIndex, endIndex) => { // let length = endIndex - startIndex; (startIndex > endIndex) ? None : { let index = (startIndex + endIndex) / 2; let median = numbers[index]; switch (num < median, median == num, num > median) { | (true, false, false) => findIndex(numbers, num, startIndex, index - 1) | (false, true, false) => Some(index) | (false, false, true) => findIndex(numbers, num, index + 1, endIndex) | _ => None ","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":"2021-02-14T16:49:13.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"y-sumanth"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/y-sumanth","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"00fce6e3daa94755913b8a8eed618882","snippet":"let find = (xs, x) => { let rec finder = (left, right) => { let mid = (left + right) / 2 switch (true) { | _ when left > right => None | _ when xs[mid] < x => finder(mid + 1, right) | _ when xs[mid] > x => finder(left, mid - 1) | _ => Some(mid) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-07T19:47:17.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"glennj"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/glennj","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"7c696755563f41fcb68a2bfdb60d3241","snippet":"/* https://en.wikipedia.org/wiki/Binary_search_algorithm */ let find = (xs, x) => { let rec binary_search = (xs, l, r, t) => { let m = (l + r) / 2; let search = m' => switch (xs[m']) { | xs_m when xs_m < t => binary_search(xs, m' + 1, r, t) | xs_m when xs_m > t => binary_search(xs, l, r - 1, t) | _ => Some(m') ","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":"2019-02-01T11:10:52.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"tS7hKamAYL84j91"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/tS7hKamAYL84j91","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"95c2af13e2b14783b5647e9eba13e560","snippet":"let find = (ns, n) => { let rec findHelper = (l, r) => { let center = (l + r) / 2; if (l > r) { None } else { switch(ns[center]) { | v when v == n => Some(center) | v when v < n => findHelper(center + 1, r) | _ => findHelper(l, center - 1) ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":7,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-15T00:06:43.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"Abdisalan"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/Abdisalan","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"c7243040e0594375abafed251a4d83f9","snippet":"let middle = (i, j) => (j - i) / 2 + i; let rec find_inner = (i, j, xs, x) => { let mid = middle(i, j); switch (i, j) { | _ when xs[mid] == x => Some(mid) | (i, j) when i == j => None | (i, _) when x < xs[mid] => find_inner(i, mid - 1, xs, x) | (_, j) when x > xs[mid] => find_inner(mid + 1, j, xs, x) | _ => None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-22T16:53:49.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"martinGrogan"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/martinGrogan","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"15ce1cc7ca934ebc981530135bc70114","snippet":"let rec findInRange = (lo, hi, numbers, number) => { let mi = (hi + lo) / 2; if (hi <= lo) { None; } else if (number == numbers[mi]) { Some(mi); } else if (number < numbers[mi]) { findInRange(lo, mi, numbers, number); } else { findInRange(mi + 1, hi, numbers, number); ","num_views":0,"num_stars":2,"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":"2018-08-10T13:12:57.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"dbalmain"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/dbalmain","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"26826d26641a46a6bde46dead4737b4d","snippet":"let find = (xs, x) => { let low = 0; let high = Array.length(xs) - 1; let rec binarySearch = (low, high) => if (low > high) { None; } else { let mid = (low + high) / 2; switch (compare(x, xs[mid])) { | 0 => Some(mid) ","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":"2019-09-15T19:25:52.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"hongchangwu"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/hongchangwu","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"b0a751843b3a47e593445772e309ef7b","snippet":"let find = (searchList, term) => { let rec search = (low, high) => if (low > high) { None; } else { let chopI = low + (high - low) / 2; let chopVal = searchList[chopI]; if (chopVal < term) { search(chopI + 1, high); } else if (chopVal > term) { ","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":"2018-08-13T19:22:44.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"evilpingwin"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/evilpingwin","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"8f83a2df2b5e4dc3a0cf46c06dd805b1","snippet":"let rec binarySearch = (xs, x, i) => { let sub = (start, len) => Array.sub(xs, start, len); let m = Array.length(xs) / 2; let len = Array.length(xs); let binarySearchLeft = () => binarySearch(sub(0, m), x, i); let binarySearchRight = () => binarySearch(sub(m + 1, len - m - 1), x, i + m + 1); let binarySearchMiddle = () => Some(i + m); switch (Array.length(xs)) { | 0 => None ","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":"2018-10-18T13:54:46.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"unchartedworks"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/unchartedworks","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"4834e010112c4ad38889f3f0965ea432","snippet":"let head = (arr, n) => Array.sub(arr, 0, n) let tail = (arr, n) => Array.sub(arr, n, Array.length(arr) - n) let rec find = (arr, n) => { switch(Array.length(arr)) { | 0 => None | i => switch(compare(arr[i / 2], n)) { | 0 => Some(i / 2) | 1 => find(arr->head(i / 2), n) | -1 => switch(find(arr->tail(succ(i / 2)), n)) { ","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":"2020-01-06T18:06:32.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"Thewessen"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/Thewessen","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"24fbcc12ee15473b8ec667c677a2a76b","snippet":"let rec findRec = (target, value, nextRange) => { let (startRange, endRange) = nextRange let last = endRange === startRange let currentIndex = switch (last) { | true => endRange | false => Js.Math.floor((endRange + startRange)->float_of_int /. 2.0) } let currentValue = target[currentIndex] if (currentValue === value) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-29T21:39:32.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"ybootin"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/ybootin","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}},{"uuid":"bf4e9a18b34b46c3b4eaa9e73b8a8553","snippet":"type ordering = | LT | EQ | GT; let (<=>) = (l, r) => l < r ? LT : l == r ? EQ : GT; let rec binarySearch = (haystack, needle, low, high) => if (low > high) { None; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-09T18:42:31.000Z","is_out_of_date":false,"language":"reasonml","author":{"handle":"bionikspoon"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"ReasonML","icon_url":"https://assets.exercism.org/tracks/reasonml.svg","highlightjs_language":"reasonml"},"links":{"public_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/solutions/bionikspoon","private_iterations_url":"https://exercism.org/uk/tracks/reasonml/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":25,"total_pages":2,"unscoped_total":25}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери