{"request":{"endpoint":"https://exercism.org/api/v2/tracks/prolog/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"9b5bbcd0205b419db41ed407d0c4ac52","snippet":"find(List, Target, Index) :- binary_search(List, Target, 0, Index). % binary_search(+List, +Target, +Offset, -Index) binary_search([], _, _, _) :- fail. binary_search(List, Target, Offset, Index) :- length(List, Len), Mid is Len // 2, nth0(Mid, List, MidVal), ( Target =:= MidVal -> ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-12T17:54:49.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"marcosciorio"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/marcosciorio","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"27ce37cd974a432b971ae8a1ddcdf4b8","snippet":"find(List, Value, Index) :- length(List, ListSize), Lower is 0, Upper is ListSize - 1, find(List, Lower, Upper, Value, Index). find(List, Lower, Upper, Value, Index) :- valid(Lower, Upper, List), Middle is div(Lower + Upper, 2), nth0(Middle, List, MiddleValue), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-15T23:31:12.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kkweon"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/kkweon","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"b10593c469be4a988d56d0f135250b97","snippet":"find(List, Value, Index) :- length(List, Last), find(List, Value, 0, Last, Index). find(List, Value, First, Last, Index) :- First < Last, Index0 is (First + Last) div 2, nth0(Index0, List, Value0), ( Value0 < Value -> succ(Index0, Index1), find(List, Value, Index1, Last, Index) ","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":"2024-03-09T01:40:49.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"stellartux"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/stellartux","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"7291e154d8bb465ca41e318c8295f701","snippet":":- use_module(library(clpfd)). find(List, Value, Index, Lower, Upper) :- Lower #=< Upper, MiddleIndex #= (Lower + Upper) // 2, nth0(MiddleIndex, List, MiddleValue), (MiddleValue #< Value -> find(List, Value, Index, MiddleIndex + 1, Upper); MiddleValue #> Value -> find(List, Value, Index, Lower, MiddleIndex - 1); Index = MiddleIndex, !). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-07T12:19:47.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"8038ff37689d4b3fbb01e878879dcbb5","snippet":" /* find(+List, +Elem, -Index) The algorithm looks like this: Find the middle element of a sorted list and compare it with the item we're looking for. If the middle element is our item, then we're done! ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-04-02T13:08:12.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"enkire"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/enkire","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"907ff5ccb35b49bdb5b28789a18ac591","snippet":"find(List, Value, Index) :- length(List, R), find(List, Value, 0, R, Index). find(A, V, L, R, I) :- L < R, M is (L + R) // 2, nth0(M, A, U), (U == V -> I = M; U > V -> find(A, V, L, M, I); find(A, V, M + 1, R, I)). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-16T13:28:30.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"anseok"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/anseok","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"3fb8a58c7c5f49d896281104a7655e7a","snippet":"find(List, Value, Index) :- length(List, L), Max is L - 1, bin_srch(List, Value, 0, Max, Index). % bin_srch(List, Element, First, Last, Index) bin_srch(List, X, A, A, A) :- nth0(A, List, X). bin_srch(List, X, Min, Max, Index) :- Min < Max, Mid is Min + (Max - Min) // 2, nth0(Mid, List, E), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-05-15T13:00:50.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"hug0Faraco"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/hug0Faraco","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"88c2575bad1541eba98e1f137d0654fe","snippet":"find(List, Value, Ind):- encuentra(List, Value, Ind, 0). encuentra(Lista, C, IndS, IndA):- length(Lista, Len), Len >0, N is Len // 2, length(ListaIzq, N), append(ListaIzq, [C|_], Lista), IndS is IndA+N. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-15T11:26:43.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Cutvy"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/Cutvy","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"3c4ab23ac51e4ac18ce93c0fe3dde86a","snippet":"/* find(List, Value, Index). */ dividir_mitad(Lista, Mitad1, Mitad2) :- length(Lista, LTotal), N is LTotal // 2, length(Mitad1, N), append(Mitad1, Mitad2, Lista). find(Lista, Elem, Indice) :- dividir_mitad(Lista, Mitad1, [Elem|_]), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-08T11:02:22.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Ismael05ag"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/Ismael05ag","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"a957946d1f5541a5a6c4a5e1644478c4","snippet":"find(L, E, LR):- length(L, Li), Len is Li / 2, floor(Len, LR), nth0(LR, L, E). find(L, E, I2):- length(L, Li), Len is Li / 2, floor(Len, LR), nth0(LR, L, EM), EM < E, append(_, [EM|L2], L), find(L2, E, I), I2 is I + LR + 1. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-04-08T10:41:42.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Juanpramo"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/Juanpramo","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"d4f84a9d79e241558979ab1193bf4c5c","snippet":"% Exercism binary_search find(List, Value, Index) :- sort(List, SortedList), length(SortedList, Length), find_helper(SortedList, Value, 0, Length, Index). find_helper(List, Value, Lower, Upper, Index) :- Lower =< Upper, MidIndex is (Lower + Upper) // 2, ","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":"2026-06-10T20:33:19.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"moodymarmot"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/moodymarmot","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"f0e2dc04b2504908a5245ff089345272","snippet":"%find(List, Value, Index). find([Value], Value, 0). find(List, Value, N) :- length(List, D), N is D // 2, nth0(N,List,Elem), Elem =:= Value. find(List, Value, Index) :- length(List, D), ","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":"2026-06-14T19:00:45.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AntonioDePadua-Rodriguez"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/AntonioDePadua-Rodriguez","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"73893b8213a643eaac03308178f17cee","snippet":"% Main predicate find(List, Target, Index) :- is_sorted(List), % Verify list is sorted binary_search(List, Target, 0, Index). % Binary search helper low/high bounds binary_search(List, Target, Low, Index) :- length(List, Length), Low < Length, Mid is (Low + Length - 1) // 2, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":40,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-10-09T22:03:18.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"baniks2001"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/baniks2001","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"c9222985885540c3931ebb8f1877e9ea","snippet":"% Binary search implementation - finds Value in sorted List at Index (0-based) find(List, Value, Index) :- length(List, Len), binary_search(List, Value, 0, Len, Index). binary_search(List, Value, Left, Right, Index) :- Left < Right, Mid is (Left + Right) // 2, nth0(Mid, List, MidValue), ","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":"2025-10-14T01:41:02.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kenokabe"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/kenokabe","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"b08a02640ba8496dbde0b38998e59e50","snippet":"get_middle_element(List, MiddleIndex, Middle) :- length(List, Length), MiddleIndex is Length // 2, nth0(MiddleIndex, List, Middle), !. find(List, Value, Index) :- find(List, Value, 0, Index). find(List, Value, CurrIndex, Index) :- get_middle_element(List, MiddleIndex, Value), Index is CurrIndex + MiddleIndex, !. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-03-06T14:01:20.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"codebr3aker"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/codebr3aker","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"4cf23265e151476ab8f106fe330c3e13","snippet":"find( List , Value , Index ) :- busqueda_binaria( List , Value , Index ). busqueda_binaria( Lista , Valor , IndiceA ) :- length( Lista , Length ), Divide is Length // 2, divideLista( Lista , Divide , ListaI , [ Cabeza | Resto ] ), Cabeza < Valor, busqueda_binaria( Resto , Valor , IndiceD ), length( ListaI , IndiceI ), IndiceA is IndiceI + IndiceD + 1. busqueda_binaria( Lista , Valor , IndiceI ) :- length( Lista , Length ), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-08T15:05:50.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AlexisRojasUHU"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/AlexisRojasUHU","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"b07d0ec4c8fc4fe587b40be2d58c85bd","snippet":"%find(List, Value, Index). find(L,Elem,I) :- length(L,Tam), Tam2 is Tam div 2, length(LMitad,Tam2), append(LMitad,[Elem|_],L), I is Tam2. find(L,V,I2) :- length(L,Tam), Tam2 is Tam div 2, length(LMitad,Tam2), append(LMitad,[Elem|Res],L), V > Elem, find(Res,V,I), I2 is I + Tam2 + 1. find(L,V,I2) :- length(L,Tam), Tam2 is Tam div 2, length(LMitad,Tam2), append(LMitad,[Elem|_],L), V < Elem, find(LMitad,V,I), I2 is I. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-05-28T16:39:48.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Elisammc"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/Elisammc","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"1d775ed79fcf499a8ba911aecf6b1aa7","snippet":"find(List, Value, Index) :- length(List, Length), find(List, Value, 1, Length, Index). find(List, Value, Lower, Upper, Index) :- Lower =< Upper, Middle is (Lower + Upper) // 2, nth1(Middle, List, Element), ( Value < Element -> Upper1 is Middle - 1, find(List, Value, Lower, Upper1, Index) ; Value > Element -> ","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":"2025-02-10T10:35:20.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"gumminoppe"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/gumminoppe","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"d48fe911c0f74983a1c66eaeb095ba89","snippet":"find([Value], Value, 0). find(List, Value, Index) :- length(List, Len), Len > 1, HeadLen is Len div 2, append(Head, Tail, List), length(Head, HeadLen), Tail = [Mid|_], ( Value < Mid, find(Head, Value, Index), !; find(Tail, Value, Tmp), Index is Tmp + HeadLen ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-02-11T08:57:56.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"liuq901"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/liuq901","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"afc7bc38a8704003ae20cb3a96223738","snippet":"find(List, Value, Index, Left, Right):- Left =< Right, Mid is Left + (Right - Left) div 2, nth0(Mid, List, Val1), (Val1 == Value -> Index = Mid; Val1 > Value -> Right1 is Mid - 1, find(List, Value, Index, Left, Right1); Val1 < Value -> Left1 is Mid +1, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-23T19:21:41.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"DimitarIvanov7"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/DimitarIvanov7","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"eeaca9ac72d349afa1a6a95834535ebe","snippet":"find(List, Value, Index) :- sort(List, SortedList), length(SortedList, Length), NextId is Length // 2, binary_search(SortedList, Value, NextId, 0, Length, Index). binary_search(List, Value, Id, Left, Right, Target) :- Id >= Left, Id < Right, nth0(Id, List, Num), ( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-14T04:38:31.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"mortalreminderpt"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/mortalreminderpt","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"93fa59d2faaf425cb65afac7c5b5331d","snippet":"find([X], X, 0) :- !. find(Xs, X, Index) :- length(Xs, Len), Len_2 is Len div 2, split_at(Len_2, Xs, Pre, Elem, Post), ( Elem =:= X -> Index = Len_2 ; Elem < X -> find(Post, X, Index0), Index is Index0 + Len_2 + 1 ","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":"2024-03-29T03:44:11.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"jinwoo"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/jinwoo","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"44084363a792470db9ae543d4d13e738","snippet":"% find(+List, +Value, -Index) % Performs binary search on a sorted list. find(List, Value, Index) :- length(List, Len), Len > 0, binary_search(List, Value, 0, Len, Index). % binary_search(+List, +Value, +Low, +High, -Index) binary_search(_, _, Low, High, _) :- Low >= High, !, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-10-09T22:15:15.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"June-Lian"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/June-Lian","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}},{"uuid":"d17bba8978ca4387a8a17d5f92f3060f","snippet":"% find(List, Value, Index) % Performs binary search on a sorted list. find(List, Value, Index) :- binary_search(List, Value, 0, Index). % Base case: empty list — value not found binary_search([], _, _, _) :- fail. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-10-12T09:51:20.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"raymondit102"},"exercise":{"title":"Двійковий пошук","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/solutions/raymondit102","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":45,"total_pages":2,"unscoped_total":45}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери