{"id":143,"date":"2024-11-10T19:06:28","date_gmt":"2024-11-10T19:06:28","guid":{"rendered":"https:\/\/akosgombkoto.info\/?page_id=143"},"modified":"2025-01-15T09:06:12","modified_gmt":"2025-01-15T09:06:12","slug":"quick-sort-algoritmus","status":"publish","type":"page","link":"https:\/\/akosgombkoto.info\/en\/quick-sort-algoritmus\/","title":{"rendered":"Quick Sort Algorithm"},"content":{"rendered":"

[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

Quick sort rendez\u00e9si algoritmus<\/h1>\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

A Quick Sort rendez\u00e9si algoritmus az egyik leggyakrabban haszn\u00e1lt listarendez\u0151 algoritmus.<\/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

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).<\/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

A Quick Sort algoritmus egy elv\u00e1laszt\u00e1sos rendez\u00e9si algoritmus, amely az „oszd meg \u00e9s uralkodj” (divide and conquer) elvet alkalmazza. A m\u0171k\u00f6d\u00e9si elve a k\u00f6vetkez\u0151 l\u00e9p\u00e9sekb\u0151l \u00e1ll:<\/p>\n

1. Pivot kiv\u00e1laszt\u00e1sa
A Quick Sort els\u0151 l\u00e9p\u00e9se a pivot elem kiv\u00e1laszt\u00e1sa. A pivot lehet b\u00e1rmi az adott list\u00e1ban, p\u00e9ld\u00e1ul az els\u0151, az utols\u00f3, vagy a k\u00f6z\u00e9ps\u0151 elem. A pivot elem lesz az alap, amely alapj\u00e1n az elemeket rendezni fogjuk.<\/p>\n

2. Particion\u00e1l\u00e1s (Elv\u00e1laszt\u00e1s)
A k\u00f6vetkez\u0151 l\u00e9p\u00e9sben az algoritmus a pivot elem k\u00f6r\u00e9 rendezi az elemeket:<\/p>\n

Az \u00f6sszes olyan elemet, amely kisebb, mint a pivot, a pivot el\u00e9 helyezi.
Az \u00f6sszes olyan elemet, amely nagyobb, mint a pivot, a pivot m\u00f6g\u00e9 helyezi.
Ezut\u00e1n a pivot helyet cser\u00e9l a list\u00e1ban, \u00edgy az v\u00e9glegesen a megfelel\u0151 hely\u00e9re ker\u00fcl.<\/p>\n

3. Rekurz\u00edv rendez\u00e9s
Miut\u00e1n a pivot a megfelel\u0151 helyre ker\u00fclt, az algoritmus rekurz\u00edvan megh\u00edvja mag\u00e1t a pivot bal \u00e9s jobb oldal\u00e1n l\u00e9v\u0151 r\u00e9szekre (a pivot nem ker\u00fcl \u00fajra rendez\u00e9sre, mert m\u00e1r a megfelel\u0151 helyen van).<\/p>\n

Az algoritmus \u00fajra v\u00e9gigmegy a kisebb \u00e9s nagyobb elemek rendez\u00e9s\u00e9n a bal \u00e9s jobb r\u00e9szekben.
A rekurzi\u00f3 folytat\u00f3dik, am\u00edg a list\u00e1k nem tartalmaznak m\u00e1r t\u00f6bb, mint egy elemet, ekkor azok rendezettek lesznek.<\/p>\n

4. Befejez\u00e9s
A rekurzi\u00f3 minden egyes szinten befejez\u0151dik, amikor minden r\u00e9szlista m\u00e1r rendezett. Az algoritmus v\u00e9g\u00fcl egy rendezett list\u00e1t ad vissza a r\u00e9szlist\u00e1k egyes\u00edt\u00e9s\u00e9vel.<\/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=”|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

def 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
[\/et_pb_toggle][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","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>\n","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}]}}