{"request":{"endpoint":"https://exercism.org/api/v2/tracks/fsharp/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"b0b8accb332343579737e99b75f199f0","snippet":"module BinarySearch let find (input:int[]) value = let rec search lo hi = if hi < lo then None else let mid = (lo+hi)/2 let candidate = input.[mid] if candidate = value then Some mid elif value < candidate then search lo (mid-1) ","num_views":0,"num_stars":3,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-06T09:09:08.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"sergey-tihon"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/sergey-tihon","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"3d997f3fcc3a477bba207a325dee320f","snippet":"module BinarySearch let crack (input: 'T list) = let split = input.Length/2 input.[..split-1],input.[split],input.[split+1..] let rec findRec input value = match input with | [i,x] when x = value -> Some i | [_,x] when x <> value -> None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"jrr"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/jrr","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"2621670058aa4943a14cf923d5ed17b4","snippet":"module BinarySearch let find (input: int[]) (value: int): int option = let rec binarySearchForIndex input value startIndex endIndex = let length = endIndex - startIndex match length, startIndex + length / 2 with | 0, _ -> None | 1, i -> input |> Array.tryItem i ","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":"2022-08-26T17:17:11.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"CodeMan99"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/CodeMan99","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"669d31dd33b941d1a0b5d1020b6147fa","snippet":"module BinarySearch let find (input: int[]) (value: int) : int option = let rec search left right : int option = match left > right with | true -> None | _ -> let middle = (left + right) / 2 match input.[middle] with | x when x = value -> ","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":"2022-06-23T10:52:41.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"station72"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/station72","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"805c88b434bf46c5b0ec6985392e1d64","snippet":"module BinarySearch let find (input: int []) (value: int) : int option = let rec calc min max = if min > max then None else let middle = (min + max) / 2 match input[middle] with ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-19T23:53:04.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"erpcf"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/erpcf","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"4da62f8e6903461381198eb385c971f3","snippet":"module BinarySearch let rec find_h input value index = let listLen = input |> Array.length match listLen with | 0 -> None | 1 -> if input[0] = value then Some(index) else None | _ -> let midPoint = int (listLen / 2) if input[midPoint] = value then ","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":"2022-01-22T21:16:24.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"kylepace"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/kylepace","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"69033740f90a41f1acfa04a41090839d","snippet":"module BinarySearch let find input value = let rec find' arr acc = match arr with | [||] -> None | [|x|] -> match x with | x when x = value -> Some acc ","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":"2022-04-11T15:37:19.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"chadnt"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/chadnt","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"e3d2210db2bb47999bedd610a3e8b799","snippet":"module BinarySearch let find (input: int[]) value = let rec loop min max = let mid = (min+max)/2 if min > max then None else match input[mid] with | i when i = value -> ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-03T16:59:21.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ericnerby"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/ericnerby","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"f353c967279247789022894ce62d071b","snippet":"module BinarySearch let rec findInRange (input: array) (value: int) (left: int) (right: int) : int option = let middle = (left + right) / 2 if left >= input.Length || right < 0 then None elif left = right && value <> input[middle] then None else match compare input[middle] value with | 0 -> Some middle | 1 -> findInRange input value 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":"2022-01-07T14:37:11.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ihordyrman"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/ihordyrman","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"4ee07595b7c74420ae166909b77aa596","snippet":"module BinarySearch let rec find input value = let rec aux min max = if min > max then None else let middle = (min + max) / 2 match Array.item middle input with | x when x < value -> aux (middle + 1) max ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-09T23:15:23.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"lpedras"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/lpedras","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"66dc584d548646ccb1875526f7585a64","snippet":"module BinarySearch let find (input: int[]) (value: int): int option = let rec binarySearch h t (value: int): int option = match (h + t) / 2 with | i when t < i || i < h -> None | i when input[i] = value -> Some(i) | i when input[i] > value -> binarySearch h (i - 1) value | i -> binarySearch (i + 1) t value binarySearch 0 (input.Length - 1) value","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-02T14:47:25.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Toaster3"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/Toaster3","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"98db19745a2a4ab6ba835e6b402086b4","snippet":"module BinarySearch let find (input: int array) (value: int) = let rec search (indexMin: int) (indexMax: int) = if indexMin > indexMax then None else let indexMid = (indexMin + indexMax) / 2 let midValue = input[indexMid] if midValue = value then Some indexMid elif midValue > value then search indexMin (indexMid - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-10T22:39:39.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"uknudsen"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/uknudsen","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"56ef99636daf41ebb996b84c3d0b6f23","snippet":"module BinarySearch let rec findr (input: array) (value: int) (min: int) (max: int): int option = if min > max then None else let mid = (min + max) / 2 if input[mid] = value then Some(mid) elif input[mid] < value then findr input value (mid + 1) max else findr input value min (mid - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-07T10:11:49.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"hakanai-9897"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/hakanai-9897","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"823d4780825646b8a82260054bb8ab94","snippet":"module BinarySearch let find (input: int array) (value: int) = let rec findIndex (values: int array) (target: int) idx = match values with | [||] -> None | [| e |] -> if e = target then Some idx else None | _ -> let middle = values.Length / 2 let value = values[middle] ","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":"2023-04-19T02:22:05.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mrunes"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/mrunes","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"a0064daecff044389d59c8947021c435","snippet":"module BinarySearch let find (input: int array) (value: int): int Option = let rec loop (input': (int * int) array): int Option = match input' with | [||] -> None | [|(index, _)|] -> Some index | _ -> ","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":"2023-04-19T10:49:02.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mrboring"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/mrboring","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"c37538d96d594af8aa1c21118cf53e75","snippet":"module BinarySearch let find (input: int array) value = let rec findAtIdx first last = match (last + first) / 2 with | _ when first = last -> None | mid when value = input.[mid] -> Some mid | mid when value > input.[mid] -> findAtIdx (mid + 1) last | mid when value < input.[mid] -> findAtIdx first (mid) | _ -> None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-10T15:22:26.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ForBalah"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/ForBalah","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"57c94d7039c04fee93b5ca9b45a21692","snippet":"module BinarySearch let find input value = let rec tryFind bounds input value = let l = Array.length input if l <= 0 then None else let left = if Option.isSome (fst bounds) then Option.get (fst bounds) else 0 let right = if Option.isSome (snd bounds) then Option.get (snd bounds) else l - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-25T14:48:27.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"BeranekP"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/BeranekP","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"41b96309d6514a32a8d2c6bf3a4d39e8","snippet":"module BinarySearch let find input value = let rec findrec input index = match input with | [] -> None | head::last -> if head = value then Some index else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-30T04:52:50.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"kiramishima"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/kiramishima","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"32f3db4ef8a54ace8e0029f6faeca6eb","snippet":"module BinarySearch let find (input: int[]) (value: int): int option = let rec finder i j = if i > j then None else let mid = int ((i + j) / 2) match input[mid] with | item when value < item -> finder i (mid - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-09T04:29:36.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"glennj"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/glennj","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"dabe9fc8344a443c872a8b6bedb20939","snippet":"module BinarySearch let find (input: int array) value = let rec findInternal (input: int array) value startPos endPos = if startPos > endPos then None else let curr = (endPos + startPos)/2 if input.[curr] = value then Some curr ","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":"2023-03-13T21:52:44.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"roninsb"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/roninsb","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"2391b38fecc54b6b906c035b70a1ff7c","snippet":"module BinarySearch let find (input: 'a array) value = let rec iter lb ub = if lb >= ub then None else let m = (lb + ub) / 2 match input.[m] with | x when x = value -> Some m ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-28T20:01:50.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"bgraf"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/bgraf","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"5db355c3daaf4fd0a6ed941eefe93a39","snippet":"module BinarySearch let find (input : int[]) value = let rec comparer startIndex endIndex = match startIndex > endIndex with | true -> None | false -> let mid = (startIndex + endIndex) / 2 match value = input[mid] with | true -> Some mid ","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":"2023-01-12T16:50:30.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"andradefr8"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/andradefr8","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"450ebbf85d974cdfb58b698fccf5ee86","snippet":"module BinarySearch let find (input: int array) value = let rec go lo hi = let mid = (hi + lo) / 2 in Array.tryItem mid input |> Option.bind (function | v when v = value -> Some mid | _ when mid = lo || mid = hi -> None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-30T18:33:01.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Samboozle"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/Samboozle","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}},{"uuid":"2bc0073f48954429b13d7a9fe2c7b64a","snippet":"module BinarySearch let rec findIndexOf (input: 'T array) (value: 'T) (minIdx: int) (maxIdx: int): Option = if (minIdx > maxIdx) then None else let midIdx = (minIdx + maxIdx) / 2 let midValue = input[midIdx] if (value = midValue) then Some midIdx else if (value < midValue) then findIndexOf input value minIdx (midIdx - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-14T17:19:34.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"pX"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/solutions/pX","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":241,"total_pages":11,"unscoped_total":241}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders