{"id":16941,"date":"2024-03-15T13:58:02","date_gmt":"2024-03-15T13:58:02","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/"},"modified":"2025-08-07T07:10:44","modified_gmt":"2025-08-07T07:10:44","slug":"how-can-you-sort-an-array-in-c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/","title":{"rendered":"How can you sort an array in C++?"},"content":{"rendered":"<p>C++ offers various sorting algorithms to sort arrays, with the most commonly used being quicksort, mergesort, and insertion sort. Below is an example code using these sorting algorithms to sort an array:<\/p>\n<ol>\n<li>Quick sort:<\/li>\n<\/ol>\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<span class=\"hljs-keyword\">using<\/span> <span class=\"hljs-keyword\">namespace<\/span> std;\r\n\r\n<span class=\"hljs-comment\">\/\/ \u5206\u533a\u51fd\u6570<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">int<\/span> <span class=\"hljs-title\">partition<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> low, <span class=\"hljs-type\">int<\/span> high)<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> pivot = arr[high];\r\n    <span class=\"hljs-type\">int<\/span> i = (low - <span class=\"hljs-number\">1<\/span>);\r\n\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> j = low; j &lt;= high - <span class=\"hljs-number\">1<\/span>; j++) {\r\n        <span class=\"hljs-keyword\">if<\/span> (arr[j] &lt; pivot) {\r\n            i++;\r\n            <span class=\"hljs-built_in\">swap<\/span>(arr[i], arr[j]);\r\n        }\r\n    }\r\n    <span class=\"hljs-built_in\">swap<\/span>(arr[i + <span class=\"hljs-number\">1<\/span>], arr[high]);\r\n    <span class=\"hljs-keyword\">return<\/span> (i + <span class=\"hljs-number\">1<\/span>);\r\n}\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> 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> pi = <span class=\"hljs-built_in\">partition<\/span>(arr, low, high);\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, low, pi - <span class=\"hljs-number\">1<\/span>);\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, pi + <span class=\"hljs-number\">1<\/span>, high);\r\n    }\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u6d4b\u8bd5\u4ee3\u7801<\/span>\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\">64<\/span>, <span class=\"hljs-number\">25<\/span>, <span class=\"hljs-number\">12<\/span>, <span class=\"hljs-number\">22<\/span>, <span class=\"hljs-number\">11<\/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    <span class=\"hljs-built_in\">quickSort<\/span>(arr, <span class=\"hljs-number\">0<\/span>, n - <span class=\"hljs-number\">1<\/span>);\r\n\r\n    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        cout &lt;&lt; arr[i] &lt;&lt; <span class=\"hljs-string\">\" \"<\/span>;\r\n\r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">0<\/span>;\r\n}\r\n<\/code><\/pre>\n<ol>\n<li>Merge sort:<\/li>\n<\/ol>\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<span class=\"hljs-keyword\">using<\/span> <span class=\"hljs-keyword\">namespace<\/span> std;\r\n\r\n<span class=\"hljs-comment\">\/\/ \u5408\u5e76\u4e24\u4e2a\u5b50\u6570\u7ec4<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">merge<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> l, <span class=\"hljs-type\">int<\/span> m, <span class=\"hljs-type\">int<\/span> r)<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> n1 = m - l + <span class=\"hljs-number\">1<\/span>;\r\n    <span class=\"hljs-type\">int<\/span> n2 = r - m;\r\n\r\n    <span class=\"hljs-type\">int<\/span> L[n1], R[n2];  <span class=\"hljs-comment\">\/\/ \u4e34\u65f6\u6570\u7ec4<\/span>\r\n\r\n    <span class=\"hljs-comment\">\/\/ \u5c06\u6570\u636e\u590d\u5236\u5230\u4e34\u65f6\u6570\u7ec4<\/span>\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> i = <span class=\"hljs-number\">0<\/span>; i &lt; n1; i++)\r\n        L[i] = arr[l + i];\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> j = <span class=\"hljs-number\">0<\/span>; j &lt; n2; j++)\r\n        R[j] = arr[m + <span class=\"hljs-number\">1<\/span> + j];\r\n\r\n    <span class=\"hljs-comment\">\/\/ \u5408\u5e76\u4e34\u65f6\u6570\u7ec4<\/span>\r\n    <span class=\"hljs-type\">int<\/span> i = <span class=\"hljs-number\">0<\/span>;\r\n    <span class=\"hljs-type\">int<\/span> j = <span class=\"hljs-number\">0<\/span>;\r\n    <span class=\"hljs-type\">int<\/span> k = l;\r\n    <span class=\"hljs-keyword\">while<\/span> (i &lt; n1 &amp;&amp; j &lt; n2) {\r\n        <span class=\"hljs-keyword\">if<\/span> (L[i] &lt;= R[j]) {\r\n            arr[k] = L[i];\r\n            i++;\r\n        } <span class=\"hljs-keyword\">else<\/span> {\r\n            arr[k] = R[j];\r\n            j++;\r\n        }\r\n        k++;\r\n    }\r\n\r\n    <span class=\"hljs-comment\">\/\/ \u590d\u5236\u5269\u4f59\u7684\u5143\u7d20<\/span>\r\n    <span class=\"hljs-keyword\">while<\/span> (i &lt; n1) {\r\n        arr[k] = L[i];\r\n        i++;\r\n        k++;\r\n    }\r\n\r\n    <span class=\"hljs-keyword\">while<\/span> (j &lt; n2) {\r\n        arr[k] = R[j];\r\n        j++;\r\n        k++;\r\n    }\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u5f52\u5e76\u6392\u5e8f\u51fd\u6570<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">mergeSort<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> l, <span class=\"hljs-type\">int<\/span> r)<\/span> <\/span>{\r\n    <span class=\"hljs-keyword\">if<\/span> (l &lt; r) {\r\n        <span class=\"hljs-type\">int<\/span> m = l + (r - l) \/ <span class=\"hljs-number\">2<\/span>;\r\n        <span class=\"hljs-built_in\">mergeSort<\/span>(arr, l, m);\r\n        <span class=\"hljs-built_in\">mergeSort<\/span>(arr, m + <span class=\"hljs-number\">1<\/span>, r);\r\n\r\n        <span class=\"hljs-built_in\">merge<\/span>(arr, l, m, r);\r\n    }\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u6d4b\u8bd5\u4ee3\u7801<\/span>\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\">64<\/span>, <span class=\"hljs-number\">25<\/span>, <span class=\"hljs-number\">12<\/span>, <span class=\"hljs-number\">22<\/span>, <span class=\"hljs-number\">11<\/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    <span class=\"hljs-built_in\">mergeSort<\/span>(arr, <span class=\"hljs-number\">0<\/span>, n - <span class=\"hljs-number\">1<\/span>);\r\n\r\n    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        cout &lt;&lt; arr[i] &lt;&lt; <span class=\"hljs-string\">\" \"<\/span>;\r\n\r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">0<\/span>;\r\n}\r\n<\/code><\/pre>\n<ol>\n<li>Insertion sort:<\/li>\n<\/ol>\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<span class=\"hljs-keyword\">using<\/span> <span class=\"hljs-keyword\">namespace<\/span> std;\r\n\r\n<span class=\"hljs-comment\">\/\/ \u63d2\u5165\u6392\u5e8f\u51fd\u6570<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">insertionSort<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> n)<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> i, key, j;\r\n    <span class=\"hljs-keyword\">for<\/span> (i = <span class=\"hljs-number\">1<\/span>; i &lt; n; i++) {\r\n        key = arr[i];\r\n        j = i - <span class=\"hljs-number\">1<\/span>;\r\n\r\n        <span class=\"hljs-comment\">\/\/ \u5c06\u6bd4 key \u5927\u7684\u5143\u7d20\u5411\u540e\u79fb\u52a8<\/span>\r\n        <span class=\"hljs-keyword\">while<\/span> (j &gt;= <span class=\"hljs-number\">0<\/span> &amp;&amp; arr[j] &gt; key) {\r\n            arr[j + <span class=\"hljs-number\">1<\/span>] = arr[j];\r\n            j = j - <span class=\"hljs-number\">1<\/span>;\r\n        }\r\n        arr[j + <span class=\"hljs-number\">1<\/span>] = key;\r\n    }\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u6d4b\u8bd5\u4ee3\u7801<\/span>\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\">64<\/span>, <span class=\"hljs-number\">25<\/span>, <span class=\"hljs-number\">12<\/span>, <span class=\"hljs-number\">22<\/span>, <span class=\"hljs-number\">11<\/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    <span class=\"hljs-built_in\">insertionSort<\/span>(arr, n);\r\n\r\n    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        cout &lt;&lt; arr<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>C++ offers various sorting algorithms to sort arrays, with the most commonly used being quicksort, mergesort, and insertion sort. Below is an example code using these sorting algorithms to sort an array: Quick sort: #include &lt;iostream&gt; using namespace std; \/\/ \u5206\u533a\u51fd\u6570 int partition(int arr[], int low, int high) { int pivot = arr[high]; int i [&hellip;]<\/p>\n","protected":false},"author":12,"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":[453,1402,299,1404,1403],"class_list":["post-16941","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-development","tag-guide","tag-programming","tag-technology","tag-tutorial"],"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 can you sort an array in C++? - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.\" \/>\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-can-you-sort-an-array-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How can you sort an array in C++?\" \/>\n<meta property=\"og:description\" content=\"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-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-15T13:58:02+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-08-07T07:10:44+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-can-you-sort-an-array-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/\"},\"author\":{\"name\":\"Liam\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671\"},\"headline\":\"How can you sort an array in C++?\",\"datePublished\":\"2024-03-15T13:58:02+00:00\",\"dateModified\":\"2025-08-07T07:10:44+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/\"},\"wordCount\":46,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"keywords\":[\"Development\",\"guide\",\"programming\",\"technology\",\"tutorial\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/\",\"name\":\"How can you sort an array in C++? - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-15T13:58:02+00:00\",\"dateModified\":\"2025-08-07T07:10:44+00:00\",\"description\":\"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"How can you sort an array 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 can you sort an array in C++? - Blog - Silicon Cloud","description":"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.","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-can-you-sort-an-array-in-c\/","og_locale":"en_US","og_type":"article","og_title":"How can you sort an array in C++?","og_description":"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.","og_url":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-15T13:58:02+00:00","article_modified_time":"2025-08-07T07:10:44+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-can-you-sort-an-array-in-c\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/"},"author":{"name":"Liam","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/23786905eb7b377f45ddb01c17da7671"},"headline":"How can you sort an array in C++?","datePublished":"2024-03-15T13:58:02+00:00","dateModified":"2025-08-07T07:10:44+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/"},"wordCount":46,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"keywords":["Development","guide","programming","technology","tutorial"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/","url":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/","name":"How can you sort an array in C++? - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-15T13:58:02+00:00","dateModified":"2025-08-07T07:10:44+00:00","description":"Learn about how can you sort an array in c++?. Comprehensive guide with examples and best practices.","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-can-you-sort-an-array-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"How can you sort an array 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\/16941","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=16941"}],"version-history":[{"count":1,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/16941\/revisions"}],"predecessor-version":[{"id":50520,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/16941\/revisions\/50520"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=16941"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=16941"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=16941"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}