{"id":14509,"date":"2024-03-15T09:19:09","date_gmt":"2024-03-15T09:19:09","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/"},"modified":"2025-08-06T09:39:54","modified_gmt":"2025-08-06T09:39:54","slug":"how-to-use-the-quicksort-function-in-c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/","title":{"rendered":"C++ Quicksort Implementation Guide"},"content":{"rendered":"<p>The quick sort function in C++ can be used by following these steps:<\/p>\n<ol>\n<li>&#8220;Include the iostream library.&#8221;<\/li>\n<li>Create a quicksort function that takes an array to be sorted, a starting index, and an ending index as parameters.<\/li>\n<li>In the quicksort function, select a pivot element (usually the first element of the array).<\/li>\n<li>Set up two pointers, one pointing to the starting index and one pointing to the ending index.<\/li>\n<li>Place elements smaller than the reference element to the left, and elements larger to the right.<\/li>\n<li>Recursively call the quick sort function to sort the left and right subarrays of the pivot element.<\/li>\n<li>Call the quicksort function outside the quicksort function to sort the array.<\/li>\n<\/ol>\n<p>Here is an example code using the quick sort function:<\/p>\n<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\r\n<span class=\"hljs-comment\">\/\/ \u5feb\u901f\u6392\u5e8f\u51fd\u6570<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">quickSort<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> start, <span class=\"hljs-type\">int<\/span> end)<\/span> <\/span>{\r\n    <span class=\"hljs-keyword\">if<\/span> (start &lt; end) {\r\n        <span class=\"hljs-type\">int<\/span> pivot = arr[start]; <span class=\"hljs-comment\">\/\/ \u57fa\u51c6\u5143\u7d20<\/span>\r\n        <span class=\"hljs-type\">int<\/span> i = start; <span class=\"hljs-comment\">\/\/ \u5de6\u6307\u9488<\/span>\r\n        <span class=\"hljs-type\">int<\/span> j = end; <span class=\"hljs-comment\">\/\/ \u53f3\u6307\u9488<\/span>\r\n\r\n        <span class=\"hljs-keyword\">while<\/span> (i &lt; j) {\r\n            <span class=\"hljs-comment\">\/\/ \u4ece\u53f3\u5f80\u5de6\u627e\u5230\u6bd4\u57fa\u51c6\u5143\u7d20\u5c0f\u7684\u5143\u7d20<\/span>\r\n            <span class=\"hljs-keyword\">while<\/span> (i &lt; j &amp;&amp; arr[j] &gt;= pivot) {\r\n                j--;\r\n            }\r\n            <span class=\"hljs-keyword\">if<\/span> (i &lt; j) {\r\n                arr[i] = arr[j];\r\n                i++;\r\n            }\r\n\r\n            <span class=\"hljs-comment\">\/\/ \u4ece\u5de6\u5f80\u53f3\u627e\u5230\u6bd4\u57fa\u51c6\u5143\u7d20\u5927\u7684\u5143\u7d20<\/span>\r\n            <span class=\"hljs-keyword\">while<\/span> (i &lt; j &amp;&amp; arr[i] &lt;= pivot) {\r\n                i++;\r\n            }\r\n            <span class=\"hljs-keyword\">if<\/span> (i &lt; j) {\r\n                arr[j] = arr[i];\r\n                j--;\r\n            }\r\n        }\r\n\r\n        arr[i] = pivot; <span class=\"hljs-comment\">\/\/ \u5c06\u57fa\u51c6\u5143\u7d20\u653e\u5230\u6b63\u786e\u7684\u4f4d\u7f6e<\/span>\r\n\r\n        <span class=\"hljs-comment\">\/\/ \u9012\u5f52\u8c03\u7528\u5feb\u901f\u6392\u5e8f\u51fd\u6570<\/span>\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, start, i - <span class=\"hljs-number\">1<\/span>); <span class=\"hljs-comment\">\/\/ \u5bf9\u5de6\u8fb9\u7684\u5b50\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f<\/span>\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, i + <span class=\"hljs-number\">1<\/span>, end); <span class=\"hljs-comment\">\/\/ \u5bf9\u53f3\u8fb9\u7684\u5b50\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f<\/span>\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    <span class=\"hljs-type\">int<\/span> arr[] = {<span class=\"hljs-number\">5<\/span>, <span class=\"hljs-number\">2<\/span>, <span class=\"hljs-number\">8<\/span>, <span class=\"hljs-number\">3<\/span>, <span class=\"hljs-number\">1<\/span>, <span class=\"hljs-number\">6<\/span>};\r\n    <span class=\"hljs-type\">int<\/span> n = <span class=\"hljs-built_in\">sizeof<\/span>(arr) \/ <span class=\"hljs-built_in\">sizeof<\/span>(arr[<span class=\"hljs-number\">0<\/span>]);\r\n\r\n    std::cout &lt;&lt; <span class=\"hljs-string\">\"\u539f\u59cb\u6570\u7ec4\uff1a\"<\/span>;\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> i = <span class=\"hljs-number\">0<\/span>; i &lt; n; ++i) {\r\n        std::cout &lt;&lt; arr[i] &lt;&lt; <span class=\"hljs-string\">\" \"<\/span>;\r\n    }\r\n    std::cout &lt;&lt; std::endl;\r\n\r\n    <span class=\"hljs-built_in\">quickSort<\/span>(arr, <span class=\"hljs-number\">0<\/span>, n - <span class=\"hljs-number\">1<\/span>); <span class=\"hljs-comment\">\/\/ \u8c03\u7528\u5feb\u901f\u6392\u5e8f\u51fd\u6570<\/span>\r\n\r\n    std::cout &lt;&lt; <span class=\"hljs-string\">\"\u6392\u5e8f\u540e\u7684\u6570\u7ec4\uff1a\"<\/span>;\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> i = <span class=\"hljs-number\">0<\/span>; i &lt; n; ++i) {\r\n        std::cout &lt;&lt; arr[i] &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>Output result:<\/p>\n<pre class=\"post-pre\"><code>\u539f\u59cb\u6570\u7ec4\uff1a5 2 8 3 1 6 \r\n\u6392\u5e8f\u540e\u7684\u6570\u7ec4\uff1a1 2 3 5 6 8\r\n<\/code><\/pre>\n<p>In the example above, we defined a quickSort function to sort an array quickly. We then called this function in the main function, and outputted the sorted array.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The quick sort function in C++ can be used by following these steps: &#8220;Include the iostream library.&#8221; Create a quicksort function that takes an array to be sorted, a starting index, and an ending index as parameters. In the quicksort function, select a pivot element (usually the first element of the array). Set up two [&hellip;]<\/p>\n","protected":false},"author":7,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"categories":[1],"tags":[274,665,799,3188,3189],"class_list":["post-14509","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-c","tag-code-optimization","tag-programming-tutorial","tag-quicksort","tag-sorting-algorithm"],"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>C++ Quicksort Implementation Guide - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.\" \/>\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-use-the-quicksort-function-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"C++ Quicksort Implementation Guide\" \/>\n<meta property=\"og:description\" content=\"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-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-15T09:19:09+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-08-06T09:39:54+00:00\" \/>\n<meta name=\"author\" content=\"Sophia Anderson\" \/>\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=\"Sophia Anderson\" \/>\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-use-the-quicksort-function-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/\"},\"author\":{\"name\":\"Sophia Anderson\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/19a24313de9c988db3d69226b4a40a30\"},\"headline\":\"C++ Quicksort Implementation Guide\",\"datePublished\":\"2024-03-15T09:19:09+00:00\",\"dateModified\":\"2025-08-06T09:39:54+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/\"},\"wordCount\":158,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"keywords\":[\"c#\",\"code optimization\",\"programming tutorial\",\"quicksort\",\"sorting algorithm\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/\",\"name\":\"C++ Quicksort Implementation Guide - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-15T09:19:09+00:00\",\"dateModified\":\"2025-08-06T09:39:54+00:00\",\"description\":\"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++ Quicksort Implementation Guide\"}]},{\"@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\/19a24313de9c988db3d69226b4a40a30\",\"name\":\"Sophia Anderson\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/c726c09aa40e37115fb5c62d0c3ed62c16ca255d3763e2e3ae83a70ddf8c2175?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/c726c09aa40e37115fb5c62d0c3ed62c16ca255d3763e2e3ae83a70ddf8c2175?s=96&d=mm&r=g\",\"caption\":\"Sophia Anderson\"},\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/sophiaanderson\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"C++ Quicksort Implementation Guide - Blog - Silicon Cloud","description":"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.","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-use-the-quicksort-function-in-c\/","og_locale":"en_US","og_type":"article","og_title":"C++ Quicksort Implementation Guide","og_description":"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.","og_url":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-15T09:19:09+00:00","article_modified_time":"2025-08-06T09:39:54+00:00","author":"Sophia Anderson","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Sophia Anderson","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/"},"author":{"name":"Sophia Anderson","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/19a24313de9c988db3d69226b4a40a30"},"headline":"C++ Quicksort Implementation Guide","datePublished":"2024-03-15T09:19:09+00:00","dateModified":"2025-08-06T09:39:54+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/"},"wordCount":158,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"keywords":["c#","code optimization","programming tutorial","quicksort","sorting algorithm"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/","url":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/","name":"C++ Quicksort Implementation Guide - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-15T09:19:09+00:00","dateModified":"2025-08-06T09:39:54+00:00","description":"Learn to implement quicksort algorithm in C++ with step-by-step instructions. Optimize your code efficiency now.","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-quicksort-function-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"C++ Quicksort Implementation Guide"}]},{"@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\/19a24313de9c988db3d69226b4a40a30","name":"Sophia Anderson","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/c726c09aa40e37115fb5c62d0c3ed62c16ca255d3763e2e3ae83a70ddf8c2175?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c726c09aa40e37115fb5c62d0c3ed62c16ca255d3763e2e3ae83a70ddf8c2175?s=96&d=mm&r=g","caption":"Sophia Anderson"},"url":"https:\/\/www.silicloud.com\/blog\/author\/sophiaanderson\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/14509","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\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=14509"}],"version-history":[{"count":2,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/14509\/revisions"}],"predecessor-version":[{"id":158541,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/14509\/revisions\/158541"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=14509"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=14509"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=14509"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}