[et_pb_section fb_built=”1″ admin_label=”Header” _builder_version=”4.27.3″ _module_preset=”default” custom_padding=”0px||0px||false|false” global_colors_info=”{}”][et_pb_row column_structure=”1_2,1_2″ _builder_version=”4.16″ _module_preset=”default” custom_padding=”0px|||||” global_colors_info=”{}”][et_pb_column type=”1_2″ _builder_version=”4.16″ _module_preset=”default” global_colors_info=”{}”][et_pb_image src=”https:\/\/akosgombkoto.info\/wp-content\/uploads\/2025\/01\/data-science-070-2.png” title_text=”data-science-070-2″ _builder_version=”4.27.4″ _module_preset=”default” max_width_tablet=”500px” max_width_phone=”220px” max_width_last_edited=”off|tablet” max_height_tablet=”200px” max_height_phone=”100px” max_height_last_edited=”on|phone” custom_margin=”|||-8vw|false|false” custom_margin_tablet=”|||0vw|false|false” custom_margin_phone=”” custom_margin_last_edited=”on|tablet” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″][\/et_pb_image][\/et_pb_column][et_pb_column type=”1_2″ _builder_version=”4.16″ _module_preset=”default” custom_padding=”120px||||false|false” custom_padding_tablet=”0px||||false|false” custom_padding_phone=”” custom_padding_last_edited=”on|tablet” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.3″ _module_preset=”d72c0383-6487-4f2c-ac5c-7d48a6376757″ header_font=”Roboto Slab||||||||” header_text_color=”#000000″ header_font_size=”52px” header_line_height=”1.2em” custom_margin=”||10px||false|false” header_font_size_tablet=”40px” header_font_size_phone=”20px” header_font_size_last_edited=”on|phone” locked=”off” global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][et_pb_image src=”https:\/\/akosgombkoto.info\/wp-content\/uploads\/2024\/11\/03_Binary_Search_Kepernyokep-2024-11-09-204252-1.png” title_text=”03_Binary_Search_K\u00e9perny\u0151k\u00e9p 2024-11-09 204252 (1)” show_in_lightbox=”on” _builder_version=”4.27.3″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ admin_label=”Blog” _builder_version=”4.16″ _module_preset=”default” global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” text_font=”Roboto Mono||||||||” text_text_color=”#fcb03a” text_font_size=”18px” text_line_height=”1.8em” background_color=”#042f4f” custom_padding=”15px|20px|15px|20px|true|true” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
Binary Search is one of the most commonly used algorithms for searching in a list.\nThe code was executed twice, as shown in the image. It includes error handling: the element 52 is found in the list defined in the code, as seen in the Visual Studio command line output, while for the element 61, it correctly indicates that it is not part of the list, which is indeed true.<\/p>\n
[\/et_pb_text][et_pb_toggle title=”Binary Search m\u0171k\u00f6d\u00e9se: (leny\u00edl\u00f3 tartalom – kattints a jobb sz\u00e9ls\u0151 + ikonra)” open_toggle_text_color=”#fcb03a” open_toggle_background_color=”#042f4f” closed_toggle_text_color=”#fcb03a” closed_toggle_background_color=”#042f4f” icon_color=”#fcb03a” open_icon_color=”#fcb03a” _builder_version=”4.27.4″ _module_preset=”default” title_font_size=”18px” closed_title_font_size=”18px” body_text_color=”#FFFFFF” body_font_size=”16px” body_line_height=”1.8em” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
Binary Search is an efficient algorithm for searching in sorted lists, applying the divide-and-conquer principle. The steps are as follows:<\/p>\n
1. Conditions:
Binary Search requires that the list containing the data to be searched is sorted, meaning the elements must be arranged in ascending (or descending) order.<\/p>\n
2. Initial Assumption:
The search starts with the middle element of the list. The boundaries of the search range are defined by the start (left) and the end (right) of the list.<\/p>\n
3. Examining the Middle Element:
If the middle element matches the target, the search is successful, and the position of the target is returned.
If the middle element is smaller than the target, the search continues on the right side (after the middle element).
If the middle element is larger than the target, the search continues on the left side (before the middle element).
4. Narrowing Down:
At each step, the search range is halved based on the middle element, reducing the search space and speeding up the process.<\/p>\n
5. Completion:
The search ends either when the target element is found or when the left pointer (left) surpasses the right pointer (right), indicating that the target is not in the list.<\/p>\n
Example:
Suppose we want to find the number 40 in a sorted list:<\/p>\n
[10, 20, 30, 40, 50, 60, 70, 80]\n
\nFirst Step:\nLeft pointer (left) = 0\nRight pointer (right) = 7\nMiddle element: arr[3] = 40\nSince the middle element equals the target (40), the search is successful.\n
\nTime Complexity:\nBinary Search reduces the search range by half at each step, resulting in logarithmic complexity: O(log n), where n is the number of elements in the list. Even in the worst-case scenario, only a logarithmic number of steps is required.<\/p>\n
Advantages:
Allows fast searching in large, sorted lists.
By halving the search range in each step, it quickly locates the target element.
Disadvantages:
The list must be sorted. If the list is unsorted, it must first be sorted, which adds extra time and computational cost.<\/p>\n
[\/et_pb_toggle][et_pb_toggle title=”K\u00f3dmag: (leny\u00edl\u00f3 tartalom – kattints a jobb sz\u00e9ls\u0151 + ikonra)” open_toggle_text_color=”#fcb03a” open_toggle_background_color=”#042f4f” closed_toggle_text_color=”#fcb03a” closed_toggle_background_color=”#042f4f” icon_color=”#fcb03a” open_icon_color=”#fcb03a” _builder_version=”4.27.3″ _module_preset=”default” title_font_size=”18px” closed_title_font_size=”18px” body_text_color=”#FFFFFF” body_font_size=”16px” body_line_height=”1.8em” global_colors_info=”{}”]<\/p>\n
def binary_search(list, target):\n left, right = 0, len(list) - 1\n \n while left <= right:\n mid = (left + right) \/\/ 2\n \n # Ha a k\u00f6z\u00e9ps\u0151 elem az, amit keres\u00fcnk\n if list[mid] == target:\n return mid\n \n # Ha a k\u00f6z\u00e9ps\u0151 elem nagyobb, akkor a bal oldalra keres\u00fcnk tov\u00e1bb\n elif list[mid] > target:\n right = mid - 1\n \n # Ha a k\u00f6z\u00e9ps\u0151 elem kisebb, akkor a jobb oldalra keres\u00fcnk tov\u00e1bb\n else:\n left = mid + 1\n \n # Ha nem tal\u00e1lhat\u00f3 az elem\n return -1\n\nlist = [11, 34, 52, 76, 93, 110, 67, 47,98, 75]\ntarget = 52\n\nindex = binary_search(list, target)\nif index != -1:\n print(f\"Az elem ({target}) megtal\u00e1lhat\u00f3 az {index} indexen.\")\nelse:\n print(f\"Az elem ({target}) nem tal\u00e1lhat\u00f3 a list\u00e1ban.\")<\/pre>\n<\/code><\/p>\n[\/et_pb_toggle][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>","protected":false},"excerpt":{"rendered":"
Bin\u00e1ris keres\u00e9si algoritmusA Binary Search az egyik leggyakrabban alkalmazott list\u00e1ban val\u00f3 keres\u00e9sre alkalmas algoritmus.A k\u00f3dja k\u00e9tszer lett lefuttatva, mint a k\u00e9pen l\u00e1tszik, van benne hibakezel\u00e9s, azaz az 52-es elemet megtal\u00e1lja a k\u00f3dban l\u00e9v\u0151 list\u00e1b\u00f3l, mint az a Visual Studio-ban k\u00e9sz\u00fclt k\u00f3dr\u00f3l k\u00e9sz\u00fclt k\u00e9p parancssor\u00e1ban l\u00e1tszik, a 61-es elemre pedig ki\u00edrja, hogy nem a lista r\u00e9sze, […]<\/p>","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-223","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/223","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/comments?post=223"}],"version-history":[{"count":14,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/223\/revisions"}],"predecessor-version":[{"id":691,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/223\/revisions\/691"}],"wp:attachment":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/media?parent=223"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}