{"request":{"endpoint":"https://exercism.org/api/v2/tracks/julia/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"158b4e53f19c4f6fa1bda63b1d9eb321","snippet":"binarysearch = searchsorted","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":2,"num_loc":1,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-08-27T18:01:26.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"MartinBonde"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/MartinBonde","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"ff1c36d5ce0d4a9ca74357a61b569056","snippet":"function binarysearch(list, val; rev=false, by=identity, lt = <) comp(a,b) = rev ? lt(a,b) : lt(b,a) byval = by(val) rangeup = length(list) up = rangeup + 1 rangedn = 1 while up > rangedn md = fld(up + rangedn, 2) comp(byval, by(list[md])) ? rangedn = md + 1 : up = md end ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-31T17:40:22.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"tSoini"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/tSoini","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"77a35de8481d483ba22d839a1317dc46","snippet":"tested_bonus_tasks = (rev = false, by = false, lt = false, multiple_matches = false) function binarysearch(search_list, value) len = length(search_list) first = 1 last = len while first <= last mid = ÷((first + last), 2) if search_list[mid] == value return mid:mid ","num_views":0,"num_stars":0,"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":"2024-04-12T16:46:09.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"colinleach"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/colinleach","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"fb31559babb14dbbaeaa50452698f233","snippet":"function binarysearch(data::Vector, key; lt = <, by = identity, rev = false) range = 1:length(data) needle = by(key) _lt = lt if rev _lt = (a, b) -> lt(b, a) end while !isempty(range) idx = mid_idx(range) v = by(data[idx]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-13T07:25:04.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"tmccombs"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/tmccombs","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"722dadae6f274100b75a6ff34e300e50","snippet":"function binarysearch(array, key; by=identity, rev = false, lt = <) l=1 r=length(array) if rev lt = > end while l ≤ r i = Int(floor((l+r)/2)) if lt(by(array[i]), by(key)) l = i +1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-08T18:28:57.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"hensleyl"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/hensleyl","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"ff073a5158a1431a850a61ef5757b005","snippet":"function binarysearch(ary,num;rev=false,by=x->x,lt= <) length(ary)==0 && return(1:0) ary=map(by,ary) num=map(by,num) n=length(ary) m=0 if !rev for key=1:n if ary[key]==num return(key:key) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-09-09T01:03:57.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"ChAUE"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/ChAUE","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"8c5c3916d5db4df68a6f9946e35752e8","snippet":"function binarysearch( arr::AbstractArray, needle; i::Integer=1, j::Integer=length(arr), rev::Bool = false, lt = <, by = identity ) ::UnitRange{Integer} ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-09-15T03:10:39.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"Ionizing"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/Ionizing","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"728b895e5bb34ceba36b992926915bad","snippet":"function binarysearch(x, v; by=x->x, lt=<, rev=false) i = 1 j = length(x) v = by(v) while i <= j k = (i + j) ÷ 2 xk = by(x[k]) if xk == v # match, but we must expand range to left and right i = k ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-07T17:44:52.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"plafl"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/plafl","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"308abdfa41404479a237383d7a058c4d","snippet":"function binarysearch(array,element; by::Function=identity,rev::Bool=false) array = by.(array); element = by(element) la=length(array) iseven(la) ? step = Int(la/2) : step = Int((la+1)/2) i = step ii = 1 ie = la while step >= 1 if array[i] == element return i:i ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-12T11:35:55.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"drpeterpunk"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/drpeterpunk","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"9bd5fe3784c9425baaada70a4d44dbb2","snippet":"function binarysearch(list, key; rev=false, by=identity, lt=ifelse(rev, >, <)) mid = (length(list) + 1) ÷ 2 mid == 0 && return 1:0 elm = by(list[mid]) elm == by(key) && return mid:mid if lt(elm, by(key)) mid .+ binarysearch(@view(list[mid+1:end]), key, rev=rev, by=by, lt=lt) else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-20T05:22:10.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"suyuxp"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/suyuxp","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"67c7f3b9b4fa4a639ab8724fdf41dac9","snippet":"function binarysearch(items, key; by = nothing, lt = nothing, rev = false) # process keyword arguments if !isnothing(by) # transform items and key items = map(by, items) key = by(key) end if isnothing(lt) lt = < end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-28T16:19:56.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"gbehm"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/gbehm","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"483b934750fd4e88b6fa23784f1ef44e","snippet":"function binarysearch(arr, el; rev=false, by=identity, lt = <) l = 1 r = length(arr) arr = rev ? reverse(arr) : arr while l <= r i = Integer(floor((r+l)/2)) if lt(by(el), by(arr[i])) ","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":"2020-12-04T00:53:54.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"karylsienn"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/karylsienn","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"60f0188fc6e14454885e07e314d3bf1a","snippet":"function binarysearch(arr, key; rev = false, lt = <, by = identity) high = length(arr) low = 1 while low <= high current = div(high + low, 2) if by(arr[current]) == by(key) return current:current elseif lt(by(arr[current]), by(key)) if rev ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-12-21T10:52:25.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"binupaul"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/binupaul","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"0c071e5352ef4163a7fbf2fd4d9d3fa8","snippet":"function binarysearch(sortedlist,num) len = length(sortedlist) if len == 0 return 1:0 end low = 1 high = len if high == 1 key = 1 else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-29T22:30:47.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"jeffcbecker"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/jeffcbecker","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"d0acdbcdff21451d97849ce70be70f90","snippet":"function binarysearch(list, elem; rev = false, by = nothing, lt = <) l = 1 r = length(list) while l <= r m = (l + r) ÷ 2 if list[m] < elem l = m + 1 elseif list[m] > elem r = m - 1 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":"2021-02-13T18:51:00.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"eric-nam"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/eric-nam","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"b6513a2ab53843129aef976f360768d4","snippet":"function binarysearch(haystack, needle; rev=false, by=identity, lt = <) first, last = 1, length(haystack) needle = by(needle) rev && (lt = >) while first <= last pivot = round(Int,((last+first)/2)) by(haystack[pivot]) == needle && return pivot:pivot if lt(by(haystack[pivot]), needle) first = pivot + 1 else ","num_views":0,"num_stars":1,"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":"2021-02-18T17:04:47.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"kbroaders"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/kbroaders","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"e377ee37a1754f40aac3562c3bcd6c9a","snippet":"function binarysearch(arr, val; rev::Bool = false, by::Function = x -> x, lt = <) last = length(arr) first = 1 val = by(val) while first <= last mid = rev ? Int(ceil((first+last)/2)) : Int(floor((first+last)/2)) compare = by(arr[mid]) ","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":"2021-03-27T12:41:55.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"mattds"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/mattds","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"9007bb5fa9b24b4ab3fc24ea88f5605c","snippet":"function binarysearch(a, x; rev=false, by=identity, lt=<) i = 1 j = length(a) if rev a = a[end:-1:1] end a = map(by, a) x = by(x) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-06T06:30:23.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"vishnusr"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/vishnusr","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"16ba6129c04448fca45b6ed704fd1e92","snippet":"function merge_ranges(left,right,right_offset) # if right is -1 then just return left if right.stop == 0 return left end # if left is -1 then return right with offset if left.stop == 0 return (right.start+right_offset:right.stop+right_offset) end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-04-07T16:36:12.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"madeofmistake"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/madeofmistake","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"b6df45624236482591201f5e68808240","snippet":"function binarysearch(list::Vector, element; rev::Bool=false, lt=<, by=identity)::UnitRange if by ≠ identity element = by(element) end function halve(left, right) if left == right-1 return left:left-1 end middle = (left + right) ÷ 2 middle_element = by(list[middle]) if middle_element == element return middle:middle end if rev ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-04T14:03:42.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"amenhotep"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/amenhotep","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"0b1dafd1b0224a1883eb569bf047cb0b","snippet":"function binarysearch(list, key) found = false fail = false beginning = 1 ending = length(list) i = 1 if list == [] return 1:0 end while !found && !fail ","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":"2021-04-07T03:00:04.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"katrina1232"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/katrina1232","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"b73535f06a7245d0b320dde2b789c434","snippet":"function smallsearch(xs, first, last, y) if last - first <= 2 y < xs[first] && (return first : first - 1) xs[first] == y && (return first : first) xs[first] < y < xs[last] && (return first + 1 : first ) xs[last] == y && (return last : last) xs[last] < y && (return last +1 : last) end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-30T02:20:33.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"tropolone"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/tropolone","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"0151ca638cad47f19081e417e6d6ab37","snippet":"@views function binarysearch(list, value; rev = false, by = x -> x, lt = <) l = rev ? reverse(by.(list)) : by.(list) v = by.(value) r = binarysearch(l[1:end], v, lt) L = length(l) + 1 rev ? (L - r.stop:L - r.start) : r end @views function binarysearch(list, value, lt) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-04-29T00:54:31.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"cvbnm9192"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/cvbnm9192","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}},{"uuid":"948c3eeec03b42e38fbbf81bd501220c","snippet":"function binarysearch(arr, target; by=x->x, lt = <, rev=false) if length(arr) == 0 return 1:0 end arr = map(by, arr) target = by(target) left = 1 right = lastindex(arr) while left < right - 1 current = (left + right) ÷ 2 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":51,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-30T18:52:05.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"paperfront"},"exercise":{"title":"बाइनरी सर्च","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/solutions/paperfront","private_iterations_url":"https://exercism.org/hi/tracks/julia/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":353,"total_pages":15,"unscoped_total":353}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स