{"id":11922,"date":"2023-01-20T07:57:01","date_gmt":"2023-01-20T07:57:01","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=11922"},"modified":"2023-02-02T09:54:37","modified_gmt":"2023-02-02T09:54:37","slug":"selection-sort-algorithm","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/","title":{"rendered":"Selection Sort Algorithm"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\" alt=\"\" \/><\/p>\n<p>In this article, we will learn what is selection sort, the selection sort algorithm with an example dry-run, what is selection sort algorithm, and how to write the program for selection sort.<\/p>\n<h2>What is Selection Sort?<\/h2>\n<p>In the selection sort, the array is sorted by finding the minimum element of the array repetitively. First, find the minimum element from the unsorted part and place that element into the beginning (for ascending order sorting). Continue this process until the array is sorted. Let\u2019s see how the selection sort algorithm works.<\/p>\n<p><strong>The selection sort algorithm works by dividing an array into two subarrays:<\/strong><\/p>\n<ul>\n<li>The already sorted subarray<\/li>\n<li>The remaining unsorted subarray<\/li>\n<\/ul>\n<p>Now, in each iteration, we will find the minimum element from the unsorted subarray and move this element to the beginning of the unsorted subarray. After the completion of each iteration, the size of the sorted subarray will be increased by 1 and after performing all the iterations the array will be sorted.<\/p>\n<h3>Selection Sort Algorithm with an example dry-run:<\/h3>\n<p>Lets see how the selection sort algorithm works with a dry-run example. We will take an unsorted array example to understand how the selection sort algorithm works.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785777-Selection%20Sort%20Algorithm1.png\" alt=\"\" \/><\/p>\n<p>We have taken an unsorted array as an example. Now, let&#8217;s see how we can sort this array using the selection sort algorithm.<\/p>\n<p><strong>First Pass:<\/strong><br \/>\nFor the first pass, we need to find the minimum element from the index 0 to 4 (0-based indexing). After that, we will replace the minimum element with the first position element.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785785-Selection%20Sort%20Algorithm2.png\" alt=\"\" \/><\/p>\n<p>In the above image, we can see that the minimum element from index 0 to 4 is 10. So we will replace 10 with 60.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785785-Selection%20Sort%20Algorithm3.png\" alt=\"\" \/><\/p>\n<p>Now, we can see that the first half till 10 is sorted, and the remaining is unsorted.<\/p>\n<p><strong>Second Pass:<\/strong><br \/>\nFor the first pass, we need to find the minimum element from the index 1 to 4. After that, we will replace the minimum element with the second position element.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785786-Selection%20Sort%20Algorithm4.png\" alt=\"\" \/><\/p>\n<p>In the above image, we can see that the minimum element from index 1 to 4 is 20. So we will replace 20 with 40.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785786-Selection%20Sort%20Algorithm5.png\" alt=\"\" \/><\/p>\n<p>Now, we can see that the first half till 20 is sorted, and the remaining is unsorted.<\/p>\n<p><strong>Third Pass:<\/strong><br \/>\nFor the first pass, we need to find the minimum element from the index 2 to 4. After that, we will replace the minimum element with the third position element.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785786-Selection%20Sort%20Algorithm6.png\" alt=\"\" \/><\/p>\n<p>In the above image, we can see that the minimum element from index 2 to 4 is 30. So we will replace 30 with 40.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785786-Selection%20Sort%20Algorithm7.png\" alt=\"\" \/><\/p>\n<p>Now, we can see that the array is already sorted. Still, we will perform the remaining passes.<\/p>\n<p><strong>Fourth Pass:<\/strong><br \/>\nFor the first pass, we need to find the minimum element from the index 3 to 4. After that, we will replace the minimum element with the fourth position element.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785786-Selection%20Sort%20Algorithm8.png\" alt=\"\" \/><\/p>\n<p>In the above image, we can see that the minimum element from index 3 to 4 is 40, and 40 is at its right position so we will not swap anything.<\/p>\n<p><strong>Fifth Pass:<\/strong><br \/>\nFor the first pass, we need to find the minimum element from index 4. After that, we will replace the minimum element with the fifth position element.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785787-Selection%20Sort%20Algorithm9.png\" alt=\"\" \/><\/p>\n<p>In the above image, we can see that the minimum element at index 4 is 60, and 60 is at its right position so we will not swap anything.<\/p>\n<h2>Selection Sort Algorithm:<\/h2>\n<ul>\n<li>selection_sort(arr,n)\n<ul>\n<li>run loop from 0 to n-1\n<ul>\n<li>initialize the first unsorted element as the minimum<\/li>\n<li>run loop to iterate through the unsorted array\n<ul>\n<li>if the current element &lt; minimum<\/li>\n<li>set the new minimum as the current element<\/li>\n<\/ul>\n<\/li>\n<li>swap the minimum with the first unsorted position<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<li>end selection sort<\/li>\n<\/ul>\n<h2>Selection Sort Program:<\/h2>\n<p>Lets see how to write the program for selection sort.<\/p>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_11924 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_11924 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_11924 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_11924 .wpsm_nav-tabs > li.active > a, #tab_container_11924 .wpsm_nav-tabs > li.active > a:hover, #tab_container_11924 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_11924 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_11924 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_11924 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_11924 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_11924 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_11924 .wpsm_nav-tabs > li > a:hover , #tab_container_11924 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_11924 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_11924 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_11924 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_11924 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_11924 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_11924 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_11924 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_11924 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_11924 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_11924 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_11924 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_11924\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_11924\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_11924_1\" aria-controls=\"tabs_desc_11924_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Python<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_11924\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_11924_1\">\r\n\t\t\t\t\t\t\t\t<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\"># Python program to perform selection sort\r\n\r\ndef selection_sort(arr,n):\r\n    for i in range(n):\r\n        \r\n        # Find the minimum element in remaining\r\n        # unsorted array\r\n        min_index = i\r\n        for j in range(i+1, n):\r\n            if arr[min_index] &gt; arr[j]:\r\n                min_index = j\r\n                \r\n        # Swap the found minimum element with\r\n        # the first element\t\r\n        arr[i], arr[min_index] = arr[min_index], arr[i]\r\n\r\n\r\narr = [60, 40, 20, 30, 10]\r\nn=len(arr)\r\n\r\nprint(\"Array befor performing the selection sort: \")\r\nfor i in range(n):\r\n    print(arr[i],end=\" \")\r\nprint()\r\nselection_sort(arr,n)\r\nprint (\"Array after performing the selection sort: \")\r\nfor i in range(n):\r\n    print(arr[i],end=\" \")\r\n\r\n<\/pre>\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_11924 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_11924 a\"),jQuery(\"#tab-content_11924\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p><strong>Output:<\/strong><\/p>\n<pre><code>Array before performing the selection sort: \n60 40 20 30 10 \nArray after performing the selection sort: \n10 20 30 40 60 <\/code><\/pre>\n<p><strong>Time Complexity:<\/strong> O(n^2) we are using the outer loop to traverse through an array and we are also using an inner loop to find minimum. Both loops runs n times. Thus, the time complexity is O(n*n) = O(n^2).<\/p>\n<p><strong>Space Complexity:<\/strong> O(1) we are not using any extra space to perform the selection sort algorithm. We are performing only swaps and the most we can perform total n swaps and performing swaps takes constant space.<\/p>\n<h3>FAQs Related to Selection Sort Algorithm<\/h3>\n<p><strong>1) The Selection sort algorithm is in place?<\/strong><br \/>\nYes, the selection sort algorithm is in place. The selection sort algorithms do not require any extra space.<\/p>\n<p><strong>2) The selection sort algorithm is stable?<\/strong><br \/>\nThis selection sort algorithm is not stable. Though, we can achieve stability in the selection sort using a similar method to the insertion sort.<\/p>\n<p><strong>3) How many maximum steps require in the selection sort algorithm?<\/strong><br \/>\nIn the worst case of the selection sort algorithm, we might perform maximum n (size of an array) swaps.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this article, we will learn what is selection sort, the selection sort algorithm with an example dry-run, what is selection sort algorithm, and how to write the program for selection sort. What is Selection Sort? In the selection sort, the array is sorted by finding the minimum element of the array repetitively. First, find [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[170],"tags":[],"class_list":["post-11922","post","type-post","status-publish","format-standard","hentry","category-sorting"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Selection Sort Algorithm<\/title>\n<meta name=\"description\" content=\"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Selection Sort Algorithm\" \/>\n<meta property=\"og:description\" content=\"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2023-01-20T07:57:01+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2023-02-02T09:54:37+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Selection Sort Algorithm\",\"datePublished\":\"2023-01-20T07:57:01+00:00\",\"dateModified\":\"2023-02-02T09:54:37+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\"},\"wordCount\":772,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\",\"articleSection\":[\"Sorting\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\",\"name\":\"Selection Sort Algorithm\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\",\"datePublished\":\"2023-01-20T07:57:01+00:00\",\"dateModified\":\"2023-02-02T09:54:37+00:00\",\"description\":\"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Sorting\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/sorting\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Selection Sort Algorithm\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Selection Sort Algorithm","description":"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.","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:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/","og_locale":"en_US","og_type":"article","og_title":"Selection Sort Algorithm","og_description":"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.","og_url":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2023-01-20T07:57:01+00:00","article_modified_time":"2023-02-02T09:54:37+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Selection Sort Algorithm","datePublished":"2023-01-20T07:57:01+00:00","dateModified":"2023-02-02T09:54:37+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/"},"wordCount":772,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg","articleSection":["Sorting"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/","url":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/","name":"Selection Sort Algorithm","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg","datePublished":"2023-01-20T07:57:01+00:00","dateModified":"2023-02-02T09:54:37+00:00","description":"Here we will learn what is selection sort,its algorithm with an example dry-run, and how to write the program for selection sort.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1674200785682-Selection%20Sort%20Algorithm.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/selection-sort-algorithm\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Sorting","item":"https:\/\/prepbytes.com\/blog\/category\/sorting\/"},{"@type":"ListItem","position":3,"name":"Selection Sort Algorithm"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/11922","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=11922"}],"version-history":[{"count":3,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/11922\/revisions"}],"predecessor-version":[{"id":12053,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/11922\/revisions\/12053"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=11922"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=11922"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=11922"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}