{"request":{"endpoint":"https://exercism.org/api/v2/tracks/go/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"eba18f2736604aa2986f61bc7935f23a","snippet":"func SearchInts(s []int, key int) int { l := 0 r := len(s) - 1 for l <= r { c := (l + r) / 2 if s[c] == key{ return c } else if s[c] < key{ l = c + 1 } else { ","num_views":0,"num_stars":0,"num_comments":2,"representation_num_published_solutions":14,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-14T01:09:30.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"jarad138"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/jarad138","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"43746a8b4e6a4bcb9c0278244e8bc5e1","snippet":"func SearchInts(list []int, key int) int { i := 0 j := len(list) - 1 for i <= j { m := i + (j - i) / 2 if list[m] == key { return m } if list[m] < key { i = m + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":12,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-04T04:48:17.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"stackcats"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/stackcats","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"bc9bfc72c75a4a898f85e5587dda2cb6","snippet":"func SearchInts(s []int, key int) int { i, j := 0, len(s)-1 for i <= j { m := i + (j-i)/2 if s[m] == key { return m } else if s[m] < key { i = m + 1 } else { j = m - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":9,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-07T10:59:03.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"Kandy44"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/Kandy44","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"e1d47c5de6244afdb56736d75806a6e2","snippet":"func SearchInts(list []int, key int) int { lIndex := 0 rIndex := len(list) - 1 for lIndex <= rIndex { mIndex := (lIndex + rIndex) / 2 if list[mIndex] < key { lIndex = mIndex + 1 } else if list[mIndex] > key { rIndex = mIndex - 1 } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":8,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-09-29T04:03:37.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"haaspt"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/haaspt","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"3e6f078afb7e456f8919c440a8c7af6e","snippet":"func SearchInts(sorted []int, key int) int { lower, upper := 0, len(sorted)-1 for upper >= lower { middle := lower + (upper-lower)/2 current := sorted[middle] switch true { case current < key: lower = middle + 1 ","num_views":0,"num_stars":8,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":7,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-02T17:08:19.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"sanevillain"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/sanevillain","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"2e95cd6bdf0c4bd780ac865c617ba2dc","snippet":"func SearchInts(slice []int, target int) int { left := 0 right := len(slice) - 1 for left <= right { middle := left + (right - left) / 2 if slice[middle] == target { return middle } else if slice[middle] < target { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-07T19:05:30.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"camilovarela"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/camilovarela","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"383f458f64124420a7dceffa35162a9a","snippet":"func SearchInts(list []int, key int) int { for left, right := 0, len(list); left != right; { mid := (left + right) / 2 switch { case list[mid] == key: return mid case key < list[mid]: right = mid default: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-30T12:46:36.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"aig79"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/aig79","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"e78f21d0040f4f19b9fa15e60e566596","snippet":"func SearchInts(a []int, k int) int { l, r := 0, len(a)-1 for l <= r { m := l + (r-l)/2 if a[m] == k { return m } if a[m] < k { l = m + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-09-17T20:35:06.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"kashifsoofi"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/kashifsoofi","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"a9fb58b1ed444e17bdd1840eaba6e5f2","snippet":"func SearchInts(list []int, key int) int { left, right := 0, len(list)-1 for left <= right { mid := (left + right) / 2 if list[mid] == key { return mid } else if list[mid] < key { left = mid + 1 } else { right = mid - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-16T22:39:54.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"andrerfcsantos"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/andrerfcsantos","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"642b50a3bd374caa821197d31cdea30f","snippet":"func SearchInts(list []int, key int) int { left, right := 0, len(list)-1 for left <= right { mid := left + (right-left)/2 if list[mid] < key { left = mid + 1 } else if list[mid] > key { right = mid - 1 } else { return mid ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-18T03:16:07.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"ravishekhar88"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/ravishekhar88","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"9a7fa3bd3186461f943f90ce75c1aa63","snippet":"func SearchInts(slice []int, key int) int { left, right := 0, len(slice)-1 for left <= right { middle := (left + right) / 2 switch { case slice[middle] < key: left = middle + 1 case slice[middle] > key: right = middle - 1 default: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":2,"num_loc":16,"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":"golang","author":{"handle":"dlacko"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/dlacko","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"7ca2916b146242cebc275f9bd683801b","snippet":"func SearchInts(list []int, key int) int { low := 0 high := len(list) - 1 for low <= high { middle := low + (high-low)/2 candidate := list[middle] if candidate == key { return middle ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-10T13:15:47.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"KeltonMartins"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/KeltonMartins","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"eae2ce65d8e3422ebb80095a80978efc","snippet":"func SearchInts(slice []int, val int) int { l, r := 0, len(slice)-1 for l <= r { m := (l + r) / 2 if slice[m] < val { l = m + 1 } else if slice[m] > val { r = m - 1 } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-24T03:30:00.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"miasm0"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/miasm0","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"081e9b47ddd3495fa336937daf47713e","snippet":"func SearchInts(list []int, key int) (index int) { return binarySearch(list, key, 0, len(list)) } func binarySearch(list []int, key int, start int, end int) (index int) { if len(list) == 0 { return -1 } if end < start { return -1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-24T23:42:42.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"rootulp"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/rootulp","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"05fe74e096c74d6fabc5c8779ca88452","snippet":"func SearchInts(list []int, key int) int { l, r := 0, len(list)-1 for l <= r { mid := (l + r) / 2 if list[mid] == key { return mid } if list[mid] < key { l = mid + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-12T14:37:06.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"fadyZohdy"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/fadyZohdy","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"277211901eb8428e8b50939018bbc726","snippet":"func SearchInts(a []int, k int) int { lo, hi := 0, len(a)-1 for lo <= hi { mid := lo + (hi - lo) / 2 if k < a[mid] { hi = mid - 1 } else if k > a[mid] { lo = mid + 1 } else { return mid ","num_views":0,"num_stars":0,"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-01-07T16:27:22.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"cpoile"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/cpoile","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"78e84bb58aa149ab9ade5ede7d763d99","snippet":"func SearchInts(ints []int, key int) int { for first, last := 0, len(ints)-1; first <= last; { middle := (first + last) / 2 switch { case ints[middle] < key: first = middle + 1 case ints[middle] > key: last = middle - 1 default: return middle ","num_views":0,"num_stars":0,"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":"2020-03-26T13:04:50.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"brie3"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/brie3","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"225a60b4f49443aaab11ba10a83e78bb","snippet":"func SearchInts(list []int, key int) int { low, high := 0, len(list)-1 for low <= high { mid := low + (high-low)/2 switch { case list[mid] == key: return mid case list[mid] < key: low = mid + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-21T19:50:51.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"Psyhackological"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/Psyhackological","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"2b1b46a435804836a73ed48fbce716ac","snippet":"func searchInts(ints []int, target, pivot int) int { if len(ints) == 0 { return -1 } middle := len(ints) / 2 if target == ints[middle] { return middle + pivot ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":18,"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":"golang","author":{"handle":"acepukas"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/acepukas","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"e9be1d9821634c04a943d1eb5feda72b","snippet":"func SearchInts(input []int, key int) int { return binarySearch(input, key, 0, len(input)-1) } func binarySearch(arr []int, key int, left int, right int) int { if left > right { return -1 } mid := (left + right) / 2 ","num_views":0,"num_stars":3,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-02T08:31:17.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"vivek-26"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/vivek-26","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"9f8f5777d9f2428db6631ab3b23c781c","snippet":"func SearchInts(slice []int, key int) int { low := 0 high := len(slice) - 1 for low <= high { mid := (low + high) / 2 if slice[mid] == key { return mid } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-22T12:01:31.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"alexpas13-1581"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/alexpas13-1581","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"3a10d56a9ca248a49aab31c31c60450c","snippet":"func SearchInts(list []int, key int) int { lo := 0 hi := len(list) - 1 for lo <= hi { mi := (lo + hi) / 2 elem := list[mi] if elem > key { hi = mi - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-01T18:29:20.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"fejesbence"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/fejesbence","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"50b88656fc8b4df5af1acd00225a9bba","snippet":"func SearchInts(list []int, key int) int { lowerBound, upperBound := 0, len(list)-1 for lowerBound <= upperBound { middleIdx := lowerBound + (upperBound-lowerBound)/2 value := list[middleIdx] if value == key { return middleIdx } if value < key { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-12-28T23:22:30.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"Dekker67"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/Dekker67","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}},{"uuid":"4a685e63c8f1445680e7125dc5bd2694","snippet":"func SearchInts(list []int, key int) int { l, r := 0, len(list)-1 for l <= r { mid := (r + l) / 2 if list[mid] == key { return mid } if list[mid] > key { r = mid - 1 } else { ","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":"2023-03-03T06:52:29.000Z","is_out_of_date":false,"language":"golang","author":{"handle":"CIS"},"exercise":{"title":"Δυαδική Αναζήτηση","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Go","icon_url":"https://assets.exercism.org/tracks/go.svg","highlightjs_language":"golang"},"links":{"public_url":"https://exercism.org/el/tracks/go/exercises/binary-search/solutions/CIS","private_iterations_url":"https://exercism.org/el/tracks/go/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":687,"total_pages":29,"unscoped_total":687}}}}}

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

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

Το Ταξίδι σου

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

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

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

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

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

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

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

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

Κάνε δωρεά

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

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

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

Insiders