[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\/02_quick_sort_Kepernyokep-2024-11-09-201432.png” title_text=”02_quick_sort_K\u00e9perny\u0151k\u00e9p 2024-11-09 201432″ 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||15px|20px|true|false” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
The Quick Sort algorithm is one of the most commonly used sorting algorithms.<\/p>\n
[\/et_pb_text][et_pb_text _builder_version=”4.27.3″ _module_preset=”default” text_font=”Roboto Mono||||||||” text_text_color=”#fcb03a” text_font_size=”18px” text_line_height=”1.8em” custom_padding=”15px||15px|20px|true|false” global_colors_info=”{}” background_color=”#042f4f”]<\/p>\n
After running the code in Visual Studio, as shown in the command prompt at the bottom of the screen (recommended to view in full-screen mode), you can see that the list defined in the code is sorted in ascending order.<\/strong><\/p>\n [\/et_pb_text][et_pb_image src=”https:\/\/akosgombkoto.info\/wp-content\/uploads\/2024\/11\/02_quick_sort_Kepernyokep-2024-11-09-201432.png” title_text=”02_quick_sort_K\u00e9perny\u0151k\u00e9p 2024-11-09 201432″ _builder_version=”4.27.3″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][et_pb_toggle title=”Quick Sort m\u0171k\u00f6d\u00e9si elv (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=”|700|||||||” 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 The Quick Sort algorithm is a divide-and-conquer sorting algorithm. Its operation involves the following steps:<\/p>\n 1. Selecting a Pivot\nThe first step in Quick Sort is choosing a pivot element. The pivot can be any element in the list, such as the first, last, or middle element. This pivot serves as the basis for sorting the other elements.<\/p>\n Partitioning All elements smaller than the pivot are placed before it.\nAll elements larger than the pivot are placed after it.\nOnce this is done, the pivot is swapped into its correct position in the list.<\/p>\n 3. Recursive Sorting The process is repeated for both smaller and larger elements on the left and right sides.\nThe recursion continues until each sublist contains only one or no elements, at which point they are considered sorted.<\/p>\n 4. Completion [\/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=”|700|||||||” 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 [\/et_pb_toggle][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>","protected":false},"excerpt":{"rendered":" Quick sort rendez\u00e9si algoritmusA Quick Sort rendez\u00e9si algoritmus az egyik leggyakrabban haszn\u00e1lt listarendez\u0151 algoritmus.A Visual Studio-ban k\u00e9sz\u00edtett k\u00f3d lefut\u00e1sa ut\u00e1n l\u00e1thatjuk a k\u00e9pen alul a parancsmez\u0151ben, hogy a k\u00f3dban megadott list\u00e1t n\u00f6vekv\u0151 sorrendbe rendezi (teljes k\u00e9perny\u0151s n\u00e9z\u00e9s az aj\u00e1nlott).A Quick Sort algoritmus egy elv\u00e1laszt\u00e1sos rendez\u00e9si algoritmus, amely az „oszd meg \u00e9s uralkodj” (divide and conquer) […]<\/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-143","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/143","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=143"}],"version-history":[{"count":26,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/143\/revisions"}],"predecessor-version":[{"id":686,"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/pages\/143\/revisions\/686"}],"wp:attachment":[{"href":"https:\/\/akosgombkoto.info\/en\/wp-json\/wp\/v2\/media?parent=143"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
A k\u00f6vetkez\u0151 l\u00e9p\u00e9sben az algoritmus a pivot elem k\u00f6r\u00e9 rendezi az elemeket:<\/p>\n
After placing the pivot in its correct position, the algorithm recursively calls itself on the sublists to the left and right of the pivot (the pivot itself is not included, as it is already sorted).<\/p>\n
The recursion ends for all levels once all sublists are sorted. The algorithm finally returns a fully sorted list by combining the sorted sublists.<\/p>\ndef quick_sort(list):\n if len(list) <= 1:\n return list\n else:\n pivot = list[len(list) \/\/ 2]\n left = []\n middle = []\n right = []\n\n for x in list:\n if x < pivot:\n left.append(x)\n elif x == pivot:\n middle.append(x)\n else:\n right.append(x)\n\n return quick_sort(left) + middle + quick_sort(right)\n\n# P\u00e9lda a haszn\u00e1latra\nlist = [10, 15, 4,21, 17,36, 2, 27, 45, 33, 29, 41, 9, 1, 5]\nsorted_list = quick_sort(list)\nprint(\"Rendezett lista:\", sorted_list)<\/pre>\n
<\/code><\/p>\n