{"id":12329,"date":"2024-03-14T15:36:06","date_gmt":"2024-03-14T15:36:06","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/"},"modified":"2025-08-05T00:13:33","modified_gmt":"2025-08-05T00:13:33","slug":"what-is-the-method-for-sorting-arrays-in-c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/","title":{"rendered":"C++ Array Sorting Methods"},"content":{"rendered":"

There are multiple sorting methods for arrays in C++, here are some common ones:<\/p>\n

    \n
  1. Bubble Sort: By comparing adjacent elements and continuously swapping positions, the larger values gradually “bubble” towards the end of the array.<\/li>\n<\/ol>\n
    void<\/span> bubbleSort<\/span>(int<\/span> arr[], int<\/span> n)<\/span> <\/span>{\r\n    for<\/span> (int<\/span> i = 0<\/span>; i < n-1<\/span>; i++) {\r\n        for<\/span> (int<\/span> j = 0<\/span>; j < n-i-1<\/span>; j++) {\r\n            if<\/span> (arr[j] > arr[j+1<\/span>]) {\r\n                int<\/span> temp = arr[j];\r\n                arr[j] = arr[j+1<\/span>];\r\n                arr[j+1<\/span>] = temp;\r\n            }\r\n        }\r\n    }\r\n}\r\n<\/code><\/pre>\n
      \n
    1. Selection Sort: Each time, the algorithm finds the smallest (or largest) element from the unsorted portion and swaps it with the first element of the unsorted portion.<\/li>\n<\/ol>\n
      void<\/span> selectionSort<\/span>(int<\/span> arr[], int<\/span> n)<\/span> <\/span>{\r\n    for<\/span> (int<\/span> i = 0<\/span>; i < n-1<\/span>; i++) {\r\n        int<\/span> minIndex = i;\r\n        for<\/span> (int<\/span> j = i+1<\/span>; j < n; j++) {\r\n            if<\/span> (arr[j] < arr[minIndex]) {\r\n                minIndex = j;\r\n            }\r\n        }\r\n        int<\/span> temp = arr[i];\r\n        arr[i] = arr[minIndex];\r\n        arr[minIndex] = temp;\r\n    }\r\n}\r\n<\/code><\/pre>\n
        \n
      1. Insertion Sort: Dividing the array into a sorted portion and an unsorted portion, each time inserting the first element of the unsorted portion into the correct position of the sorted portion.<\/li>\n<\/ol>\n
        void<\/span> insertionSort<\/span>(int<\/span> arr[], int<\/span> n)<\/span> <\/span>{\r\n    for<\/span> (int<\/span> i = 1<\/span>; i < n; i++) {\r\n        int<\/span> key = arr[i];\r\n        int<\/span> j = i - 1<\/span>;\r\n        while<\/span> (j >= 0<\/span> && arr[j] > key) {\r\n            arr[j+1<\/span>] = arr[j];\r\n            j--;\r\n        }\r\n        arr[j+1<\/span>] = key;\r\n    }\r\n}\r\n<\/code><\/pre>\n
          \n
        1. Quick Sort: Select a pivot element, partition the array into two subarrays with elements on the left less than or equal to the pivot and elements on the right greater than the pivot, recursively apply quick sort to the subarrays.<\/li>\n<\/ol>\n
          int<\/span> partition<\/span>(int<\/span> arr[], int<\/span> low, int<\/span> high)<\/span> <\/span>{\r\n    int<\/span> pivot = arr[high];\r\n    int<\/span> i = low - 1<\/span>;\r\n    for<\/span> (int<\/span> j = low; j <= high-1<\/span>; j++) {\r\n        if<\/span> (arr[j] < pivot) {\r\n            i++;\r\n            int<\/span> temp = arr[i];\r\n            arr[i] = arr[j];\r\n            arr[j] = temp;\r\n        }\r\n    }\r\n    int<\/span> temp = arr[i+1<\/span>];\r\n    arr[i+1<\/span>] = arr[high];\r\n    arr[high] = temp;\r\n    return<\/span> i + 1<\/span>;\r\n}\r\n\r\nvoid<\/span> quickSort<\/span>(int<\/span> arr[], int<\/span> low, int<\/span> high)<\/span> <\/span>{\r\n    if<\/span> (low < high) {\r\n        int<\/span> pi = partition<\/span>(arr, low, high);\r\n        quickSort<\/span>(arr, low, pi-1<\/span>);\r\n        quickSort<\/span>(arr, pi+1<\/span>, high);\r\n    }\r\n}\r\n<\/code><\/pre>\n
          These are just some common sorting algorithms, and there are implementations of other sorting algorithms in C++. Choosing the appropriate sorting algorithm based on the actual situation and needs can both improve sorting efficiency and reduce resource consumption.<\/p>\n","protected":false},"excerpt":{"rendered":"
          There are multiple sorting methods for arrays in C++, here are some common ones: Bubble Sort: By comparing adjacent elements and continuously swapping positions, the larger values gradually “bubble” towards the end of the array. void bubbleSort(int arr[], int n) { for (int i = 0; i < n-1; i++) { for (int j = […]<\/p>\n","protected":false},"author":9,"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":[7899,6257,274,11914,16110],"class_list":["post-12329","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-algorithms","tag-bubble-sort","tag-c","tag-selection-sort","tag-sorting-arrays"],"yoast_head":"\nC++ Array Sorting Methods - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.\" \/>\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\/what-is-the-method-for-sorting-arrays-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"C++ Array Sorting Methods\" \/>\n<meta property=\"og:description\" content=\"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-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-14T15:36:06+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-08-05T00:13:33+00:00\" \/>\n<meta name=\"author\" content=\"Ava Mitchell\" \/>\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=\"Ava Mitchell\" \/>\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\/what-is-the-method-for-sorting-arrays-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/\"},\"author\":{\"name\":\"Ava Mitchell\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/a3e2658c2cb9fb2be95ae0a8861f4a64\"},\"headline\":\"C++ Array Sorting Methods\",\"datePublished\":\"2024-03-14T15:36:06+00:00\",\"dateModified\":\"2025-08-05T00:13:33+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/\"},\"wordCount\":175,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"keywords\":[\"algorithms\",\"Bubble Sort\",\"c#\",\"selection sort\",\"sorting arrays\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/\",\"name\":\"C++ Array Sorting Methods - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-14T15:36:06+00:00\",\"dateModified\":\"2025-08-05T00:13:33+00:00\",\"description\":\"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++ Array Sorting Methods\"}]},{\"@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\/a3e2658c2cb9fb2be95ae0a8861f4a64\",\"name\":\"Ava Mitchell\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/15c63cd0564b4a2e07d611bcdffa296f6ea80e8db07c3091f43a84010514899d?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/15c63cd0564b4a2e07d611bcdffa296f6ea80e8db07c3091f43a84010514899d?s=96&d=mm&r=g\",\"caption\":\"Ava Mitchell\"},\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/avamitchell\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"C++ Array Sorting Methods - Blog - Silicon Cloud","description":"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.","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\/what-is-the-method-for-sorting-arrays-in-c\/","og_locale":"en_US","og_type":"article","og_title":"C++ Array Sorting Methods","og_description":"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.","og_url":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-14T15:36:06+00:00","article_modified_time":"2025-08-05T00:13:33+00:00","author":"Ava Mitchell","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Ava Mitchell","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/"},"author":{"name":"Ava Mitchell","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/a3e2658c2cb9fb2be95ae0a8861f4a64"},"headline":"C++ Array Sorting Methods","datePublished":"2024-03-14T15:36:06+00:00","dateModified":"2025-08-05T00:13:33+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/"},"wordCount":175,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"keywords":["algorithms","Bubble Sort","c#","selection sort","sorting arrays"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/","url":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/","name":"C++ Array Sorting Methods - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-14T15:36:06+00:00","dateModified":"2025-08-05T00:13:33+00:00","description":"Learn top C++ array sorting methods with code examples: Bubble Sort, Selection Sort & optimized algorithms.","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/what-is-the-method-for-sorting-arrays-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"C++ Array Sorting Methods"}]},{"@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\/a3e2658c2cb9fb2be95ae0a8861f4a64","name":"Ava Mitchell","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/15c63cd0564b4a2e07d611bcdffa296f6ea80e8db07c3091f43a84010514899d?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/15c63cd0564b4a2e07d611bcdffa296f6ea80e8db07c3091f43a84010514899d?s=96&d=mm&r=g","caption":"Ava Mitchell"},"url":"https:\/\/www.silicloud.com\/blog\/author\/avamitchell\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/12329","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\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=12329"}],"version-history":[{"count":2,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/12329\/revisions"}],"predecessor-version":[{"id":156120,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/12329\/revisions\/156120"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=12329"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=12329"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=12329"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}