{"id":2060,"date":"2024-03-12T09:09:42","date_gmt":"2024-03-12T09:09:42","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/"},"modified":"2024-03-30T15:09:07","modified_gmt":"2024-03-30T15:09:07","slug":"how-to-write-code-for-the-quicksort-algorithm-in-c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/","title":{"rendered":"How to write code for the quicksort algorithm in C++?"},"content":{"rendered":"<pre class=\"post-pre\"><code><span class=\"hljs-meta\">#<span class=\"hljs-keyword\">include<\/span> <span class=\"hljs-string\">&lt;iostream&gt;<\/span><\/span>\r\n<span class=\"hljs-meta\">#<span class=\"hljs-keyword\">include<\/span> <span class=\"hljs-string\">&lt;vector&gt;<\/span><\/span>\r\n\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">quickSort<\/span><span class=\"hljs-params\">(std::vector&lt;<span class=\"hljs-type\">int<\/span>&gt;&amp; arr, <span class=\"hljs-type\">int<\/span> low, <span class=\"hljs-type\">int<\/span> high)<\/span> <\/span>{\r\n    <span class=\"hljs-keyword\">if<\/span> (low &lt; high) {\r\n        <span class=\"hljs-type\">int<\/span> pivot = arr[low];\r\n        <span class=\"hljs-type\">int<\/span> i = low + <span class=\"hljs-number\">1<\/span>;\r\n        <span class=\"hljs-type\">int<\/span> j = high;\r\n\r\n        <span class=\"hljs-keyword\">while<\/span> (i &lt;= j) {\r\n            <span class=\"hljs-keyword\">if<\/span> (arr[i] &lt;= pivot) {\r\n                i++;\r\n            } <span class=\"hljs-keyword\">else<\/span> <span class=\"hljs-keyword\">if<\/span> (arr[j] &gt; pivot) {\r\n                j--;\r\n            } <span class=\"hljs-keyword\">else<\/span> {\r\n                std::<span class=\"hljs-built_in\">swap<\/span>(arr[i], arr[j]);\r\n            }\r\n        }\r\n\r\n        std::<span class=\"hljs-built_in\">swap<\/span>(arr[low], arr[j]);\r\n\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, low, j - <span class=\"hljs-number\">1<\/span>);\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, j + <span class=\"hljs-number\">1<\/span>, high);\r\n    }\r\n}\r\n\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">int<\/span> <span class=\"hljs-title\">main<\/span><span class=\"hljs-params\">()<\/span> <\/span>{\r\n    std::vector&lt;<span class=\"hljs-type\">int<\/span>&gt; arr = {<span class=\"hljs-number\">5<\/span>, <span class=\"hljs-number\">2<\/span>, <span class=\"hljs-number\">9<\/span>, <span class=\"hljs-number\">3<\/span>, <span class=\"hljs-number\">7<\/span>, <span class=\"hljs-number\">1<\/span>, <span class=\"hljs-number\">8<\/span>, <span class=\"hljs-number\">4<\/span>, <span class=\"hljs-number\">6<\/span>};\r\n    <span class=\"hljs-built_in\">quickSort<\/span>(arr, <span class=\"hljs-number\">0<\/span>, arr.<span class=\"hljs-built_in\">size<\/span>() - <span class=\"hljs-number\">1<\/span>);\r\n\r\n    std::cout &lt;&lt; <span class=\"hljs-string\">\"Sorted array: \"<\/span>;\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> num : arr) {\r\n        std::cout &lt;&lt; num &lt;&lt; <span class=\"hljs-string\">\" \"<\/span>;\r\n    }\r\n    std::cout &lt;&lt; std::endl;\r\n\r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">0<\/span>;\r\n}\r\n<\/code><\/pre>\n<p>This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part, and finally obtains a sorted array. In the main function, we define an integer array and call the quickSort function to sort it, then output the sorted result.<\/p>\n<p>&nbsp;<\/p>\n<p>More tutorials<\/p>\n<p><a class=\"LinkSuggestion__Link-sc-1gewdgc-4 cLBplk\" href=\"https:\/\/www.silicloud.com\/blog\/sort-the-java-collections-using-the-sort-method\/\" target=\"_blank\" rel=\"noopener\">Sort the Java Collections using the sort() method.<span class=\"sc-gswNZR eASTkv\">(Opens in a new browser tab)<\/span><\/a><\/p>\n<p><a class=\"LinkSuggestion__Link-sc-1gewdgc-4 cLBplk\" href=\"https:\/\/www.silicloud.com\/blog\/c-implementation-of-a-2d-array\/\" target=\"_blank\" rel=\"noopener\">2D array for C++ implementation<span class=\"sc-gswNZR eASTkv\">(Opens in a new browser tab)<\/span><\/a><\/p>\n<p><a class=\"LinkSuggestion__Link-sc-1gewdgc-4 cLBplk\" href=\"https:\/\/www.silicloud.com\/blog\/what-are-the-characteristics-of-multiple-inheritance-in-object-oriented-programming-in-python\/\" target=\"_blank\" rel=\"noopener\">What are the characteristics of multiple inheritance in object-oriented programming in Python?<span class=\"sc-gswNZR eASTkv\">(Opens in a new browser tab)<\/span><\/a><\/p>\n<p><a class=\"LinkSuggestion__Link-sc-1gewdgc-4 cLBplk\" href=\"https:\/\/www.silicloud.com\/blog\/how-to-delete-elements-from-an-array-in-java\/\" target=\"_blank\" rel=\"noopener\">How to Delete Elements from an Array in Java<span class=\"sc-gswNZR eASTkv\">(Opens in a new browser tab)<\/span><\/a><\/p>\n<p><a class=\"LinkSuggestion__Link-sc-1gewdgc-4 cLBplk\" href=\"https:\/\/www.silicloud.com\/blog\/how-can-we-use-strlen-in-c-language-to-calculate-the-length-of-an-array\/\" target=\"_blank\" rel=\"noopener\">How can we use strlen in C language to calculate the length of an array?<span class=\"sc-gswNZR eASTkv\">(Opens in a new browser tab)<\/span><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>#include &lt;iostream&gt; #include &lt;vector&gt; void quickSort(std::vector&lt;int&gt;&amp; arr, int low, int high) { if (low &lt; high) { int pivot = arr[low]; int i = low + 1; int j = high; while (i &lt;= j) { if (arr[i] &lt;= pivot) { i++; } else if (arr[j] &gt; pivot) { j&#8211;; } else { std::swap(arr[i], arr[j]); [&hellip;]<\/p>\n","protected":false},"author":12,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"categories":[1],"tags":[],"class_list":["post-2060","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.5 (Yoast SEO v21.5) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>How to write code for the quicksort algorithm in C++? - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How to write code for the quicksort algorithm in C++?\" \/>\n<meta property=\"og:description\" content=\"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-03-12T09:09:42+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-03-30T15:09:07+00:00\" \/>\n<meta name=\"author\" content=\"Liam\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:site\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Liam\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\"},\"author\":{\"name\":\"Liam\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671\"},\"headline\":\"How to write code for the quicksort algorithm in C++?\",\"datePublished\":\"2024-03-12T09:09:42+00:00\",\"dateModified\":\"2024-03-30T15:09:07+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\"},\"wordCount\":144,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\",\"name\":\"How to write code for the quicksort algorithm in C++? - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-12T09:09:42+00:00\",\"dateModified\":\"2024-03-30T15:09:07+00:00\",\"description\":\"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"How to write code for the quicksort algorithm in C++?\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"name\":\"Silicon Cloud Blog\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\",\"name\":\"Silicon Cloud Blog\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"contentUrl\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"width\":1024,\"height\":1024,\"caption\":\"Silicon Cloud Blog\"},\"image\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\",\"https:\/\/twitter.com\/SiliCloudGlobal\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671\",\"name\":\"Liam\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/8d37ed3e7f770dde8bf069ba0b4298688028c3abaacf1131742fc1352d174ebd?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/8d37ed3e7f770dde8bf069ba0b4298688028c3abaacf1131742fc1352d174ebd?s=96&d=mm&r=g\",\"caption\":\"Liam\"},\"sameAs\":[\"http:\/\/Wilson\"],\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/liamwilson\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"How to write code for the quicksort algorithm in C++? - Blog - Silicon Cloud","description":"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/","og_locale":"en_US","og_type":"article","og_title":"How to write code for the quicksort algorithm in C++?","og_description":"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,","og_url":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-12T09:09:42+00:00","article_modified_time":"2024-03-30T15:09:07+00:00","author":"Liam","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Liam","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/"},"author":{"name":"Liam","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671"},"headline":"How to write code for the quicksort algorithm in C++?","datePublished":"2024-03-12T09:09:42+00:00","dateModified":"2024-03-30T15:09:07+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/"},"wordCount":144,"commentCount":0,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/","url":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/","name":"How to write code for the quicksort algorithm in C++? - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-12T09:09:42+00:00","dateModified":"2024-03-30T15:09:07+00:00","description":"This code implements the quick sort algorithm to sort an array of integers. It recursively divides the array into two parts, sorts each part,","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-the-quicksort-algorithm-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"How to write code for the quicksort algorithm in C++?"}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/blog\/#website","url":"https:\/\/www.silicloud.com\/blog\/","name":"Silicon Cloud Blog","description":"","publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.silicloud.com\/blog\/#organization","name":"Silicon Cloud Blog","url":"https:\/\/www.silicloud.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","contentUrl":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","width":1024,"height":1024,"caption":"Silicon Cloud Blog"},"image":{"@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/SiliCloudGlobal\/","https:\/\/twitter.com\/SiliCloudGlobal"]},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671","name":"Liam","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/8d37ed3e7f770dde8bf069ba0b4298688028c3abaacf1131742fc1352d174ebd?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/8d37ed3e7f770dde8bf069ba0b4298688028c3abaacf1131742fc1352d174ebd?s=96&d=mm&r=g","caption":"Liam"},"sameAs":["http:\/\/Wilson"],"url":"https:\/\/www.silicloud.com\/blog\/author\/liamwilson\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/2060","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/users\/12"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=2060"}],"version-history":[{"count":3,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/2060\/revisions"}],"predecessor-version":[{"id":72192,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/2060\/revisions\/72192"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=2060"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=2060"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=2060"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}