CINXE.COM

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-0 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>Sorting algorithms/Selection sort - Rosetta Code</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-0 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )rosettacodewikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""], "wgDefaultDateFormat":"dmy","wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"8a0ad6fcf1ebfadee9f754a8","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Sorting_algorithms/Selection_sort","wgTitle":"Sorting algorithms/Selection sort","wgCurRevisionId":349291,"wgRevisionId":349291,"wgArticleId":1473,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Pages with syntax highlighting errors","Programming Tasks","Sorting Algorithms","Sorting","11l","360 Assembly","AArch64 Assembly","Action!","ActionScript","Ada","ALGOL 68","AppleScript","ARM Assembly","Arturo","AutoHotkey","AWK","BBC BASIC","BASIC","GWBASIC","IS-BASIC","BCPL","C","C sharp","C++","Clojure","COBOL","Common Lisp","Crystal","D","Dart","Delphi","E","EasyLang","EchoLisp","Eiffel","Elena","Elixir","Erlang","Euphoria","F Sharp", "Factor","Forth","Fortran","FreeBASIC","Gambas","GAP","Go","Haskell","Haxe","Icon","Unicon","Io","J","Java","JavaScript","Jq","Julia","Kotlin","Liberty BASIC","LSE","Lua","Maple","Mathematica","Wolfram Language","MATLAB","Octave","Maxima","MAXScript","N/t/roff","Nanoquery","Nemerle","NetRexx","Nim","OCaml","Oforth","OoRexx","Oz","PARI/GP","Pascal","Perl","Phix","PHP","PicoLisp","PL/I","PowerShell","Prolog","PureBasic","Python","Qi","Quackery","R","Ra","Racket","Raku","REXX","Ring","Ruby","Run BASIC","Rust","Scala","Seed7","Sidef","Standard ML","Stata","Swift","Tcl","Tcllib","TI-83 BASIC","UBasic/4tH","Ursala","VBA","VBScript","Wren","Wren-sort","XPL0","Zkl","GUISS/Omit"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"Sorting_algorithms/Selection_sort","wgRelevantArticleId":1473,"wgIsProbablyEditable":false,"wgRelevantPageIsProbablyEditable":false,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"all", "wgCiteReferencePreviewsActive":true,"wgMFDisplayWikibaseDescriptions":{"search":false,"nearby":false,"watchlist":false,"tagline":false},"wgCheckUserClientHintsHeadersJsApi":["architecture","bitness","brands","fullVersionList","mobile","model","platform","platformVersion"],"wgIsMobile":false,"wgCentralAuthMobileDomain":false,"wgSiteNoticeId":"89.0"};RLSTATE={"ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.pygments":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","ext.CookieWarning.styles":"ready","oojs-ui-core.styles":"ready","oojs-ui.styles.indicators":"ready","mediawiki.widgets.styles":"ready","oojs-ui-core.icons":"ready","ext.MobileDetect.nomobile":"ready","ext.dismissableSiteNotice.styles":"ready"};RLPAGEMODULES=["ext.pygments.view","ext.smw.styles","smw.entityexaminer","site","mediawiki.page.ready", "mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.checkUser.clientHints","ext.CookieWarning","ext.echo.centralauth","ext.eventLogging","ext.urlShortener.toolbar","ext.toctree","ext.centralauth.centralautologin","ext.purge","ext.smw.purge","ext.dismissableSiteNotice"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.CookieWarning.styles%7Cext.MobileDetect.nomobile%7Cext.dismissableSiteNotice.styles%7Cext.pygments%7Cmediawiki.widgets.styles%7Coojs-ui-core.icons%2Cstyles%7Coojs-ui.styles.indicators%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <style>#mw-indicator-mw-helplink {display:none;}</style> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.43.0-beta"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta name="description" content="Task Sort an array (or list) of elements using the Selection sort algorithm. It works as follows: First find the smallest element in the array and exchange it..."> <meta name="twitter:site" content=""> <meta name="twitter:card" content="summary_large_image"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="Sorting algorithms/Selection sort - Rosetta Code"> <meta property="og:type" content="website"> <link rel="preconnect" href="//static.wikitide.net"> <link rel="alternate" type="application/rdf+xml" title="Sorting algorithms/Selection sort" href="/wiki/Special:ExportRDF/Sorting_algorithms/Selection_sort?xmlmime=rdf"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Rosetta Code (en)"> <link rel="EditURI" type="application/rsd+xml" href="https://rosettacode.org/w/api.php?action=rsd"> <link rel="canonical" href="https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort"> <link rel="alternate" type="application/atom+xml" title="Rosetta Code Atom feed" href="/wiki/Special:RecentChanges?feed=atom"> <link rel="dns-prefetch" href="https://meta.miraheze.org" /> <meta property="og:title" content="Sorting algorithms/Selection sort"> <meta property="og:site_name" content="Rosetta Code"> <meta property="og:url" content="https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort"> <meta property="og:description" content="Task Sort an array (or list) of elements using the Selection sort algorithm. It works as follows: First find the smallest element in the array and exchange it..."> <meta property="og:image" content="https://static.miraheze.org/rosettacodewiki/d/d3/RosettaCodeTitle.png"> <meta property="article:modified_time" content="2024-11-25T09:55:02Z"> <meta property="article:published_time" content="2024-11-25T09:55:02Z"> <script type="application/ld+json">{"@context":"http:\/\/schema.org","@type":"Article","name":"Sorting algorithms\/Selection sort - Rosetta Code","headline":"Sorting algorithms\/Selection sort - Rosetta Code","mainEntityOfPage":"Sorting algorithms\/Selection sort","identifier":"https:\/\/rosettacode.org\/wiki\/Sorting_algorithms\/Selection_sort","url":"https:\/\/rosettacode.org\/wiki\/Sorting_algorithms\/Selection_sort","description":"Task Sort an array (or list) of elements using the Selection sort algorithm. It works as follows: First find the smallest element in the array and exchange it...","dateModified":"2024-11-25T09:55:02Z","datePublished":"2024-11-25T09:55:02Z","image":{"@type":"ImageObject","url":"https:\/\/static.miraheze.org\/rosettacodewiki\/d\/d3\/RosettaCodeTitle.png"},"author":{"@type":"Organization","name":"Rosetta Code","url":"https:\/\/rosettacode.org","logo":{"@type":"ImageObject","url":"https:\/\/static.miraheze.org\/rosettacodewiki\/d\/d3\/RosettaCodeTitle.png","caption":"Rosetta Code"}},"publisher":{"@type":"Organization","name":"Rosetta Code","url":"https:\/\/rosettacode.org","logo":{"@type":"ImageObject","url":"https:\/\/static.miraheze.org\/rosettacodewiki\/d\/d3\/RosettaCodeTitle.png","caption":"Rosetta Code"}},"potentialAction":{"@type":"SearchAction","target":"https:\/\/rosettacode.org\/wiki\/Special:Search?search={search_term}","query-input":"required name=search_term"}}</script> <link rel="dns-prefetch" href="//login.miraheze.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Sorting_algorithms_Selection_sort rootpage-Sorting_algorithms skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Main menu </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-Social" class="vector-menu mw-portlet mw-portlet-Social" > <div class="vector-menu-heading"> Social </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-Discord" class="mw-list-item"><a href="https://discord.gg/JUAQDevqaH" rel="nofollow">Discord</a></li><li id="n-Facebook" class="mw-list-item"><a href="https://www.facebook.com/rosettacode" rel="nofollow">Facebook</a></li><li id="n-Twitter" class="mw-list-item"><a href="https://twitter.com/rosettacode" rel="nofollow">Twitter</a></li> </ul> </div> </div> <div id="p-Explore" class="vector-menu mw-portlet mw-portlet-Explore" > <div class="vector-menu-heading"> Explore </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-Languages" class="mw-list-item"><a href="/wiki/Category:Programming_Languages">Languages</a></li><li id="n-Tasks" class="mw-list-item"><a href="/wiki/Category:Programming_Tasks">Tasks</a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Load a random page [x]" accesskey="x">Random page</a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Rosetta_Code" class="mw-logo"> <img class="mw-logo-icon" src="https://static.miraheze.org/rosettacodewiki/c/c8/RosettaCodeTitle.ico" alt="" aria-hidden="true" height="50" width="50"> Rosetta Code </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Rosetta Code [f]" accesskey="f"> Search </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Rosetta Code" aria-label="Search Rosetta Code" autocapitalize="sentences" title="Search Rosetta Code [f]" accesskey="f" id="searchInput" > </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Appearance </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/wiki/Special:CreateAccount?returnto=Sorting+algorithms%2FSelection+sort" title="You are encouraged to create an account and log in; however, it is not mandatory" class="">Create account</a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/wiki/Special:UserLogin?returnto=Sorting+algorithms%2FSelection+sort" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o" class="">Log in</a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="More options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Personal tools </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/wiki/Special:CreateAccount?returnto=Sorting+algorithms%2FSelection+sort" title="You are encouraged to create an account and log in; however, it is not mandatory"> Create account</a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/wiki/Special:UserLogin?returnto=Sorting+algorithms%2FSelection+sort" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o"> Log in</a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing">learn more</a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y">Contributions</a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n">Talk</a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"><div id="mw-dismissablenotice-anonplace"></div><script>(function(){var node=document.getElementById("mw-dismissablenotice-anonplace");if(node){node.outerHTML="\u003Cdiv class=\"mw-dismissable-notice\"\u003E\u003Cdiv class=\"mw-dismissable-notice-close\"\u003E[\u003Ca tabindex=\"0\" role=\"button\"\u003Edismiss\u003C/a\u003E]\u003C/div\u003E\u003Cdiv class=\"mw-dismissable-notice-body\"\u003E\u003C!-- CentralNotice --\u003E\u003Cdiv id=\"localNotice\" data-nosnippet=\"\"\u003E\u003Cdiv class=\"sitenotice\" lang=\"en\" dir=\"ltr\"\u003E\u003Ctable class=\"messagebox\" style=\"text-align: center; background-color: lightblue; clear: both;\"\u003E\n\u003Ctbody\u003E\u003Ctr\u003E\n\u003Ctd\u003E\u003Ci\u003E\u003Ca rel=\"nofollow\" class=\"external text\" href=\"https://discord.gg/JUAQDevqaH\"\u003EJoin our Discord\u003C/a\u003E to discuss Rosetta Code!\u003C/i\u003E\n\u003C/td\u003E\u003C/tr\u003E\u003C/tbody\u003E\u003C/table\u003E\u003C/div\u003E\u003C/div\u003E\u003C/div\u003E\u003C/div\u003E";}}());</script></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">Beginning</div> </a> </li> <li id="toc-11l" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#11l"> <div class="vector-toc-text"> 1 11l </div> </a> <ul id="toc-11l-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-360_Assembly" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#360_Assembly"> <div class="vector-toc-text"> 2 360 Assembly </div> </a> <ul id="toc-360_Assembly-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-AArch64_Assembly" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#AArch64_Assembly"> <div class="vector-toc-text"> 3 AArch64 Assembly </div> </a> <ul id="toc-AArch64_Assembly-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Action!" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Action!"> <div class="vector-toc-text"> 4 Action! </div> </a> <ul id="toc-Action!-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-ActionScript" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#ActionScript"> <div class="vector-toc-text"> 5 ActionScript </div> </a> <ul id="toc-ActionScript-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ada" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Ada"> <div class="vector-toc-text"> 6 Ada </div> </a> <ul id="toc-Ada-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-ALGOL_68" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#ALGOL_68"> <div class="vector-toc-text"> 7 ALGOL 68 </div> </a> <ul id="toc-ALGOL_68-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-AppleScript" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#AppleScript"> <div class="vector-toc-text"> 8 AppleScript </div> </a> <ul id="toc-AppleScript-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-ARM_Assembly" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#ARM_Assembly"> <div class="vector-toc-text"> 9 ARM Assembly </div> </a> <ul id="toc-ARM_Assembly-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Arturo" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Arturo"> <div class="vector-toc-text"> 10 Arturo </div> </a> <ul id="toc-Arturo-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-AutoHotkey" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#AutoHotkey"> <div class="vector-toc-text"> 11 AutoHotkey </div> </a> <ul id="toc-AutoHotkey-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-AWK" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#AWK"> <div class="vector-toc-text"> 12 AWK </div> </a> <ul id="toc-AWK-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-BBC_BASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#BBC_BASIC"> <div class="vector-toc-text"> 13 BBC BASIC </div> </a> <ul id="toc-BBC_BASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-BASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#BASIC"> <div class="vector-toc-text"> 14 BASIC </div> </a> <button aria-controls="toc-BASIC-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle BASIC subsection </button> <ul id="toc-BASIC-sublist" class="vector-toc-list"> <li id="toc-GWBASIC" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#GWBASIC"> <div class="vector-toc-text"> 14.1 GWBASIC </div> </a> <ul id="toc-GWBASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-IS-BASIC" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#IS-BASIC"> <div class="vector-toc-text"> 14.2 IS-BASIC </div> </a> <ul id="toc-IS-BASIC-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-BCPL" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#BCPL"> <div class="vector-toc-text"> 15 BCPL </div> </a> <ul id="toc-BCPL-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-C" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#C"> <div class="vector-toc-text"> 16 C </div> </a> <ul id="toc-C-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-C#" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#C#"> <div class="vector-toc-text"> 17 C# </div> </a> <ul id="toc-C#-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-C++" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#C++"> <div class="vector-toc-text"> 18 C++ </div> </a> <ul id="toc-C++-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Clojure" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Clojure"> <div class="vector-toc-text"> 19 Clojure </div> </a> <ul id="toc-Clojure-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-COBOL" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#COBOL"> <div class="vector-toc-text"> 20 COBOL </div> </a> <ul id="toc-COBOL-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Common_Lisp" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Common_Lisp"> <div class="vector-toc-text"> 21 Common Lisp </div> </a> <ul id="toc-Common_Lisp-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Crystal" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Crystal"> <div class="vector-toc-text"> 22 Crystal </div> </a> <ul id="toc-Crystal-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-D" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#D"> <div class="vector-toc-text"> 23 D </div> </a> <ul id="toc-D-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Dart" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Dart"> <div class="vector-toc-text"> 24 Dart </div> </a> <ul id="toc-Dart-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Delphi" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Delphi"> <div class="vector-toc-text"> 25 Delphi </div> </a> <button aria-controls="toc-Delphi-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle Delphi subsection </button> <ul id="toc-Delphi-sublist" class="vector-toc-list"> <li id="toc-Array_sort" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Array_sort"> <div class="vector-toc-text"> 25.1 Array sort </div> </a> <ul id="toc-Array_sort-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-String_sort" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#String_sort"> <div class="vector-toc-text"> 25.2 String sort </div> </a> <ul id="toc-String_sort-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-E" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#E"> <div class="vector-toc-text"> 26 E </div> </a> <ul id="toc-E-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-EasyLang" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#EasyLang"> <div class="vector-toc-text"> 27 EasyLang </div> </a> <ul id="toc-EasyLang-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-EchoLisp" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#EchoLisp"> <div class="vector-toc-text"> 28 EchoLisp </div> </a> <button aria-controls="toc-EchoLisp-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle EchoLisp subsection </button> <ul id="toc-EchoLisp-sublist" class="vector-toc-list"> <li id="toc-List_sort" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#List_sort"> <div class="vector-toc-text"> 28.1 List sort </div> </a> <ul id="toc-List_sort-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Array_sort_2" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Array_sort_2"> <div class="vector-toc-text"> 28.2 Array sort </div> </a> <ul id="toc-Array_sort_2-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Eiffel" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Eiffel"> <div class="vector-toc-text"> 29 Eiffel </div> </a> <ul id="toc-Eiffel-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Elena" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Elena"> <div class="vector-toc-text"> 30 Elena </div> </a> <ul id="toc-Elena-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Elixir" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Elixir"> <div class="vector-toc-text"> 31 Elixir </div> </a> <ul id="toc-Elixir-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Erlang" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Erlang"> <div class="vector-toc-text"> 32 Erlang </div> </a> <ul id="toc-Erlang-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Euphoria" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Euphoria"> <div class="vector-toc-text"> 33 Euphoria </div> </a> <ul id="toc-Euphoria-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-F#" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#F#"> <div class="vector-toc-text"> 34 F# </div> </a> <ul id="toc-F#-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Factor" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Factor"> <div class="vector-toc-text"> 35 Factor </div> </a> <ul id="toc-Factor-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Forth" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Forth"> <div class="vector-toc-text"> 36 Forth </div> </a> <ul id="toc-Forth-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Fortran" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Fortran"> <div class="vector-toc-text"> 37 Fortran </div> </a> <ul id="toc-Fortran-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-FreeBASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#FreeBASIC"> <div class="vector-toc-text"> 38 FreeBASIC </div> </a> <ul id="toc-FreeBASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Gambas" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Gambas"> <div class="vector-toc-text"> 39 Gambas </div> </a> <ul id="toc-Gambas-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-GAP" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#GAP"> <div class="vector-toc-text"> 40 GAP </div> </a> <ul id="toc-GAP-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Go" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Go"> <div class="vector-toc-text"> 41 Go </div> </a> <ul id="toc-Go-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Haskell" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Haskell"> <div class="vector-toc-text"> 42 Haskell </div> </a> <ul id="toc-Haskell-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Haxe" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Haxe"> <div class="vector-toc-text"> 43 Haxe </div> </a> <ul id="toc-Haxe-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Icon_and_Unicon" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Icon_and_Unicon"> <div class="vector-toc-text"> 44 Icon and Unicon </div> </a> <ul id="toc-Icon_and_Unicon-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Io" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Io"> <div class="vector-toc-text"> 45 Io </div> </a> <ul id="toc-Io-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-J" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#J"> <div class="vector-toc-text"> 46 J </div> </a> <ul id="toc-J-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Java" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Java"> <div class="vector-toc-text"> 47 Java </div> </a> <ul id="toc-Java-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-JavaScript" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#JavaScript"> <div class="vector-toc-text"> 48 JavaScript </div> </a> <ul id="toc-JavaScript-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-jq" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#jq"> <div class="vector-toc-text"> 49 jq </div> </a> <ul id="toc-jq-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Julia" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Julia"> <div class="vector-toc-text"> 50 Julia </div> </a> <ul id="toc-Julia-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Kotlin" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Kotlin"> <div class="vector-toc-text"> 51 Kotlin </div> </a> <ul id="toc-Kotlin-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Liberty_BASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Liberty_BASIC"> <div class="vector-toc-text"> 52 Liberty BASIC </div> </a> <ul id="toc-Liberty_BASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-LSE" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#LSE"> <div class="vector-toc-text"> 53 LSE </div> </a> <ul id="toc-LSE-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Lua" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Lua"> <div class="vector-toc-text"> 54 Lua </div> </a> <ul id="toc-Lua-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Maple" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Maple"> <div class="vector-toc-text"> 55 Maple </div> </a> <ul id="toc-Maple-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Mathematica_/Wolfram_Language" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Mathematica_/Wolfram_Language"> <div class="vector-toc-text"> 56 Mathematica /Wolfram Language </div> </a> <ul id="toc-Mathematica_/Wolfram_Language-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-MATLAB_/_Octave" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#MATLAB_/_Octave"> <div class="vector-toc-text"> 57 MATLAB / Octave </div> </a> <ul id="toc-MATLAB_/_Octave-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Maxima" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Maxima"> <div class="vector-toc-text"> 58 Maxima </div> </a> <ul id="toc-Maxima-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-MAXScript" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#MAXScript"> <div class="vector-toc-text"> 59 MAXScript </div> </a> <ul id="toc-MAXScript-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-N/t/roff" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#N/t/roff"> <div class="vector-toc-text"> 60 N/t/roff </div> </a> <button aria-controls="toc-N/t/roff-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> Toggle N/t/roff subsection </button> <ul id="toc-N/t/roff-sublist" class="vector-toc-list"> <li id="toc-Output" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Output"> <div class="vector-toc-text"> 60.1 Output </div> </a> <ul id="toc-Output-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Nanoquery" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Nanoquery"> <div class="vector-toc-text"> 61 Nanoquery </div> </a> <ul id="toc-Nanoquery-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Nemerle" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Nemerle"> <div class="vector-toc-text"> 62 Nemerle </div> </a> <ul id="toc-Nemerle-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-NetRexx" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#NetRexx"> <div class="vector-toc-text"> 63 NetRexx </div> </a> <ul id="toc-NetRexx-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Nim" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Nim"> <div class="vector-toc-text"> 64 Nim </div> </a> <ul id="toc-Nim-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-OCaml" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#OCaml"> <div class="vector-toc-text"> 65 OCaml </div> </a> <ul id="toc-OCaml-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Oforth" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Oforth"> <div class="vector-toc-text"> 66 Oforth </div> </a> <ul id="toc-Oforth-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-ooRexx" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#ooRexx"> <div class="vector-toc-text"> 67 ooRexx </div> </a> <ul id="toc-ooRexx-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Oz" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Oz"> <div class="vector-toc-text"> 68 Oz </div> </a> <ul id="toc-Oz-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PARI/GP" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PARI/GP"> <div class="vector-toc-text"> 69 PARI/GP </div> </a> <ul id="toc-PARI/GP-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pascal" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Pascal"> <div class="vector-toc-text"> 70 Pascal </div> </a> <ul id="toc-Pascal-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Perl" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Perl"> <div class="vector-toc-text"> 71 Perl </div> </a> <ul id="toc-Perl-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Phix" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Phix"> <div class="vector-toc-text"> 72 Phix </div> </a> <ul id="toc-Phix-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PHP" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PHP"> <div class="vector-toc-text"> 73 PHP </div> </a> <ul id="toc-PHP-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PicoLisp" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PicoLisp"> <div class="vector-toc-text"> 74 PicoLisp </div> </a> <ul id="toc-PicoLisp-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PL/I" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PL/I"> <div class="vector-toc-text"> 75 PL/I </div> </a> <ul id="toc-PL/I-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PowerShell" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PowerShell"> <div class="vector-toc-text"> 76 PowerShell </div> </a> <ul id="toc-PowerShell-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Prolog" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Prolog"> <div class="vector-toc-text"> 77 Prolog </div> </a> <ul id="toc-Prolog-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-PureBasic" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#PureBasic"> <div class="vector-toc-text"> 78 PureBasic </div> </a> <ul id="toc-PureBasic-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Python" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Python"> <div class="vector-toc-text"> 79 Python </div> </a> <ul id="toc-Python-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Qi" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Qi"> <div class="vector-toc-text"> 80 Qi </div> </a> <ul id="toc-Qi-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Quackery" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Quackery"> <div class="vector-toc-text"> 81 Quackery </div> </a> <ul id="toc-Quackery-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-R" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#R"> <div class="vector-toc-text"> 82 R </div> </a> <ul id="toc-R-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ra" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Ra"> <div class="vector-toc-text"> 83 Ra </div> </a> <ul id="toc-Ra-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Racket" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Racket"> <div class="vector-toc-text"> 84 Racket </div> </a> <ul id="toc-Racket-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Raku" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Raku"> <div class="vector-toc-text"> 85 Raku </div> </a> <ul id="toc-Raku-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-REXX" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#REXX"> <div class="vector-toc-text"> 86 REXX </div> </a> <ul id="toc-REXX-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ring" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Ring"> <div class="vector-toc-text"> 87 Ring </div> </a> <ul id="toc-Ring-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ruby" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Ruby"> <div class="vector-toc-text"> 88 Ruby </div> </a> <ul id="toc-Ruby-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Run_BASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Run_BASIC"> <div class="vector-toc-text"> 89 Run BASIC </div> </a> <ul id="toc-Run_BASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Rust" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Rust"> <div class="vector-toc-text"> 90 Rust </div> </a> <ul id="toc-Rust-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Scala" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Scala"> <div class="vector-toc-text"> 91 Scala </div> </a> <ul id="toc-Scala-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Seed7" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Seed7"> <div class="vector-toc-text"> 92 Seed7 </div> </a> <ul id="toc-Seed7-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Sidef" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Sidef"> <div class="vector-toc-text"> 93 Sidef </div> </a> <ul id="toc-Sidef-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Standard_ML" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Standard_ML"> <div class="vector-toc-text"> 94 Standard ML </div> </a> <ul id="toc-Standard_ML-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Stata" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Stata"> <div class="vector-toc-text"> 95 Stata </div> </a> <ul id="toc-Stata-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Swift" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Swift"> <div class="vector-toc-text"> 96 Swift </div> </a> <ul id="toc-Swift-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Tcl" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Tcl"> <div class="vector-toc-text"> 97 Tcl </div> </a> <ul id="toc-Tcl-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-TI-83_BASIC" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#TI-83_BASIC"> <div class="vector-toc-text"> 98 TI-83 BASIC </div> </a> <ul id="toc-TI-83_BASIC-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-uBasic/4tH" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#uBasic/4tH"> <div class="vector-toc-text"> 99 uBasic/4tH </div> </a> <ul id="toc-uBasic/4tH-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Ursala" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Ursala"> <div class="vector-toc-text"> 100 Ursala </div> </a> <ul id="toc-Ursala-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-VBA" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#VBA"> <div class="vector-toc-text"> 101 VBA </div> </a> <ul id="toc-VBA-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-VBScript" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#VBScript"> <div class="vector-toc-text"> 102 VBScript </div> </a> <ul id="toc-VBScript-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Wren" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#Wren"> <div class="vector-toc-text"> 103 Wren </div> </a> <ul id="toc-Wren-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-XPL0" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#XPL0"> <div class="vector-toc-text"> 104 XPL0 </div> </a> <ul id="toc-XPL0-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-zkl" class="vector-toc-list-item vector-toc-level-1"> <a class="vector-toc-link" href="#zkl"> <div class="vector-toc-text"> 105 zkl </div> </a> <ul id="toc-zkl-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" > Toggle the table of contents </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading">Sorting algorithms/Selection sort</h1> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort" title="View the content page [c]" accesskey="c">Page</a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:Sorting_algorithms/Selection_sort" rel="discussion" title="Discussion about the content page [t]" accesskey="t">Discussion</a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >English </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort">Read</a></li><li id="ca-viewsource" class="vector-tab-noicon mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=edit" title="This page is protected.
You can view its source [e]" accesskey="e">View source</a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=history" title="Past revisions of this page [h]" accesskey="h">View history</a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" >Tools </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort">Read</a></li><li id="ca-more-viewsource" class="vector-more-collapsible-item mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=edit">View source</a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=history">View history</a></li><li id="ca-purge" class="is-disabled mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=purge">Refresh</a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/Sorting_algorithms/Selection_sort" title="A list of all wiki pages that link here [j]" accesskey="j">What links here</a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Sorting_algorithms/Selection_sort" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k">Related changes</a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q">Special pages</a></li><li id="t-print" class="mw-list-item"><a href="javascript:print();" rel="alternate" title="Printable version of this page [p]" accesskey="p">Printable version</a></li><li id="t-permalink" class="mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?oldid=349291" title="Permanent link to this revision of this page">Permanent link</a></li><li id="t-info" class="mw-list-item"><a href="/wiki/Sorting_algorithms/Selection_sort?action=info" title="More information about this page">Page information</a></li><li id="t-cite" class="mw-list-item"><a href="/wiki/Special:CiteThisPage?page=Sorting_algorithms%2FSelection_sort&id=349291&wpFormIdentifier=titleform" title="Information on how to cite this page">Cite this page</a></li><li id="t-urlshortener" class="mw-list-item"><a href="/wiki/Special:UrlShortener?url=https%3A%2F%2Frosettacode.org%2Fwiki%2FSorting_algorithms%2FSelection_sort">Get shortened URL</a></li><li id="t-smwbrowselink" class="mw-list-item"><a href="/wiki/Special:Browse/:Sorting-5Falgorithms-2FSelection-5Fsort" rel="search">Browse properties</a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> <div id="mw-indicator-smw-entity-examiner" class="mw-indicator"><div class="smw-entity-examiner smw-indicator-vertical-bar-loader" data-subject="Sorting_algorithms/Selection_sort#0##" data-dir="ltr" data-uselang="" title="Running an examiner in the background"></div></div> </div> <div id="siteSub" class="noprint">From Rosetta Code</div> </div> <div id="contentSub"><div id="mw-content-subtitle"><div class="subpages">< <bdi dir="ltr"><a href="/wiki/Sorting_algorithms" class="mw-redirect" title="Sorting algorithms">Sorting algorithms</a></bdi></div></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><div class="infobox" style="width: 2in"><figure class="mw-halign-left" typeof="mw:File"><a href="/wiki/Category:Solutions_by_Programming_Task" title="Category:Solutions by Programming Task"><img alt="Task" src="//static.wikitide.net/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/64px-Rcode-button-task-crushed.png" decoding="async" width="64" height="64" class="mw-file-element" srcset="//static.wikitide.net/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/96px-Rcode-button-task-crushed.png 1.5x, //static.wikitide.net/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/128px-Rcode-button-task-crushed.png 2x" /></a><figcaption></figcaption></figure>Sorting algorithms/Selection sort You are encouraged to <a href="/wiki/Rosetta_Code:Solve_a_Task" title="Rosetta Code:Solve a Task">solve this task</a> according to the task description, using any language you may know.</div> <div class="infobox" style="width: 2in"> <big>Sorting Algorithm</big> This is a sorting algorithm.   It may be applied to a set of data in order to sort it.     For comparing various sorts, see <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Compare_sorting_algorithms%27_performance">compare sorts</a>.   For other sorting algorithms,   see <a href="/wiki/Category:Sorting_Algorithms" title="Category:Sorting Algorithms">sorting algorithms</a>,   or: <center><a href="/wiki/O" title="O">O</a>(n logn) sorts <a href="/wiki/Sorting_algorithms/Heapsort" title="Sorting algorithms/Heapsort">Heap sort</a> | <a href="/wiki/Sorting_algorithms/Merge_sort" title="Sorting algorithms/Merge sort">Merge sort</a> | <a href="/wiki/Sorting_algorithms/Patience_sort" title="Sorting algorithms/Patience sort">Patience sort</a> | <a href="/wiki/Sorting_algorithms/Quicksort" title="Sorting algorithms/Quicksort">Quick sort</a> <a href="/wiki/O" title="O">O</a>(n log2n) sorts <a href="/wiki/Sorting_algorithms/Shell_sort" title="Sorting algorithms/Shell sort">Shell Sort</a> <a href="/wiki/O" title="O">O</a>(n2) sorts <a href="/wiki/Sorting_algorithms/Bubble_sort" title="Sorting algorithms/Bubble sort">Bubble sort</a> | <a href="/wiki/Sorting_algorithms/Cocktail_sort" title="Sorting algorithms/Cocktail sort">Cocktail sort</a> | <a href="/wiki/Sorting_algorithms/Cocktail_sort_with_shifting_bounds" title="Sorting algorithms/Cocktail sort with shifting bounds">Cocktail sort with shifting bounds</a> | <a href="/wiki/Sorting_algorithms/Comb_sort" title="Sorting algorithms/Comb sort">Comb sort</a> | <a href="/wiki/Sorting_algorithms/Cycle_sort" title="Sorting algorithms/Cycle sort">Cycle sort</a> | <a href="/wiki/Sorting_algorithms/Gnome_sort" title="Sorting algorithms/Gnome sort">Gnome sort</a> | <a href="/wiki/Sorting_algorithms/Insertion_sort" title="Sorting algorithms/Insertion sort">Insertion sort</a> | <a class="mw-selflink selflink">Selection sort</a> | <a href="/wiki/Sorting_algorithms/Strand_sort" title="Sorting algorithms/Strand sort">Strand sort</a> other sorts <a href="/wiki/Sorting_algorithms/Bead_sort" title="Sorting algorithms/Bead sort">Bead sort</a> | <a href="/wiki/Sorting_algorithms/Bogosort" title="Sorting algorithms/Bogosort">Bogo sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Common_sorted_list">Common sorted list</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_an_array_of_composite_structures">Composite structures sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_using_a_custom_comparator">Custom comparator sort</a> | <a href="/wiki/Sorting_algorithms/Counting_sort" title="Sorting algorithms/Counting sort">Counting sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_disjoint_sublist">Disjoint sublist sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/External_sort">External sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/JortSort">Jort sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_numbers_lexicographically">Lexicographical sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Natural_sorting">Natural sorting</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Order_by_pair_comparisons">Order by pair comparisons</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Order_disjoint_list_items">Order disjoint list items</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Order_two_numerical_lists">Order two numerical lists</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers">Object identifier (OID) sort</a> | <a href="/wiki/Sorting_algorithms/Pancake_sort" title="Sorting algorithms/Pancake sort">Pancake sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Quickselect_algorithm">Quickselect</a> | <a href="/wiki/Sorting_algorithms/Permutation_sort" title="Sorting algorithms/Permutation sort">Permutation sort</a> | <a href="/wiki/Sorting_algorithms/Radix_sort" title="Sorting algorithms/Radix sort">Radix sort</a> | <a href="/wiki/Ranking_methods" title="Ranking methods">Ranking methods</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Remove_duplicate_elements">Remove duplicate elements</a> | <a href="/wiki/Sorting_algorithms/Sleep_sort" title="Sorting algorithms/Sleep sort">Sleep sort</a> | <a href="/wiki/Sorting_algorithms/Stooge_sort" title="Sorting algorithms/Stooge sort">Stooge sort</a> | [<a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_the_letters_of_string_in_alphabitical_order">Sort letters of a string</a>] | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Sort_three_variables">Three variable sort</a> | <a rel="nofollow" class="external text" href="https://rosettacode.org/wiki/Topological_sort">Topological sort</a> | <a href="/wiki/Sorting_algorithms/Tree_sort_on_a_linked_list" title="Sorting algorithms/Tree sort on a linked list">Tree sort</a> </center></div> <dl><dt>Task</dt> <dd></dd></dl> Sort an <a href="/wiki/Array" title="Array">array</a> (or list) of elements using the Selection sort algorithm. It works as follows: First find the smallest element in the array and exchange it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continue in this way until the entire array is sorted. Its asymptotic complexity is   <big> <a href="/wiki/O" title="O">O</a>(n2) </big>   making it inefficient on large arrays. Its primary purpose is for when writing data is very expensive (slow) when compared to reading, eg. writing to flash memory or EEPROM. No other sorting algorithm has less data movement. <dl><dt>References</dt> <dd></dd></dl> <ul><li>  Rosetta Code:   <a href="/wiki/O" title="O">O</a>     (complexity).</li> <li>  Wikipedia:   <a href="https://en.wikipedia.org/wiki/Selection_sort" class="extiw" title="wp:Selection sort">Selection sort</a>.</li> <li>  Wikipedia:   [<a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Big_O_notation">Big O notation</a>].</li></ul> <meta property="mw:PageProp/toc" /> <h2><a href="/wiki/Category:11l" title="Category:11l">11l</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Python">Python</a></div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>F selection_sort(&lst) L(e) lst V mn = min(L.index .< lst.len, key' x -> @lst[x]) (lst[L.index], lst[mn]) = (lst[mn], e) V arr = [7, 6, 5, 9, 8, 4, 3, 1, 2, 0] selection_sort(&arr) print(arr)</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>[0, 1, 2, 3, 4, 5, 6, 7, 8, 9] </pre> <h2><a href="/wiki/Category:360_Assembly" title="Category:360 Assembly">360 Assembly</a> </h2> <div class="examplemeta translation">Translation of: <a href="#PL/I">PL/I</a></div> The program uses ASM structured macros and two ASSIST macros to keep the code as short as possible. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>* Selection sort 26/06/2016 SELECSRT CSECT USING SELECSRT,R13 base register B 72(R15) skip savearea DC 17F'0' savearea STM R14,R12,12(R13) prolog ST R13,4(R15) " ST R15,8(R13) " LR R13,R15 " LA RJ,1 j=1 DO WHILE=(C,RJ,LE,N) do j=1 to n LR RK,RJ k=j LR R1,RJ j SLA R1,2 . LA R3,A-4(R1) @a(j) L RT,0(R3) temp=a(j) LA RI,1(RJ) i=j+1 DO WHILE=(C,RI,LE,N) do i=j+1 to n LR R1,RI i SLA R1,2 . L R2,A-4(R1) a(i) IF CR,RT,GT,R2 THEN if temp>a(i) then LR RT,R2 temp=a(i) LR RK,RI k=i ENDIF , end if LA RI,1(RI) i=i+1 ENDDO , end do L R0,0(R3) a(j) LR R1,RK k SLA R1,2 . ST R0,A-4(R1) a(k)=a(j) ST RT,0(R3) a(j)=temp; LA RJ,1(RJ) j=j+1 ENDDO , end do LA R3,PG pgi=0 LA RI,1 i=1 DO WHILE=(C,RI,LE,N) do i=1 to n LR R1,RI i SLA R1,2 . L R2,A-4(R1) a(i) XDECO R2,XDEC edit a(i) MVC 0(4,R3),XDEC+8 output a(i) LA R3,4(R3) pgi=pgi+4 LA RI,1(RI) i=i+1 ENDDO , end do XPRNT PG,L'PG print buffer L R13,4(0,R13) epilog LM R14,R12,12(R13) " XR R15,R15 " BR R14 exit A DC F'4',F'65',F'2',F'-31',F'0',F'99',F'2',F'83',F'782',F'1' DC F'45',F'82',F'69',F'82',F'104',F'58',F'88',F'112',F'89',F'74' N DC A((N-A)/L'A) number of items of a PG DC CL80' ' buffer XDEC DS CL12 temp for xdeco YREGS RI EQU 6 i RJ EQU 7 j RK EQU 8 k RT EQU 9 temp END SELECSRT</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre> -31 0 1 2 2 4 45 58 65 69 74 82 82 83 88 89 99 104 112 782 </pre> <h2><a href="/wiki/Category:AArch64_Assembly" title="Category:AArch64 Assembly">AArch64 Assembly</a> </h2> <div class="examplemeta workswith">Works with: <a href="/wiki/As?action=edit&redlink=1" class="new" title="As (page does not exist)">as</a> version Raspberry Pi 3B version Buster 64 bits</div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>/* ARM assembly AARCH64 Raspberry PI 3B */ /* program selectionSort64.s */ /*******************************************/ /* Constantes file */ /*******************************************/ /* for this file see task include a file in language AArch64 assembly */ .include "../includeConstantesARM64.inc" /*********************************/ /* Initialized data */ /*********************************/ .data szMessSortOk: .asciz "Table sorted.\n" szMessSortNok: .asciz "Table not sorted !!!!!.\n" sMessResult: .asciz "Value  : @ \n" szCarriageReturn: .asciz "\n" .align 4 #TableNumber: .quad 1,3,6,2,5,9,10,8,4,7 TableNumber: .quad 10,9,8,7,6,5,4,3,2,1 .equ NBELEMENTS, (. - TableNumber) / 8 /*********************************/ /* UnInitialized data */ /*********************************/ .bss sZoneConv: .skip 24 /*********************************/ /* code section */ /*********************************/ .text .global main main: // entry of program ldr x0,qAdrTableNumber // address number table mov x1,0 mov x2,NBELEMENTS // number of élements bl selectionSort ldr x0,qAdrTableNumber // address number table bl displayTable ldr x0,qAdrTableNumber // address number table mov x1,NBELEMENTS // number of élements bl isSorted // control sort cmp x0,1 // sorted ? beq 1f ldr x0,qAdrszMessSortNok // no !! error sort bl affichageMess b 100f 1: // yes ldr x0,qAdrszMessSortOk bl affichageMess 100: // standard end of the program mov x0,0 // return code mov x8,EXIT // request to exit program svc 0 // perform the system call qAdrsZoneConv: .quad sZoneConv qAdrszCarriageReturn: .quad szCarriageReturn qAdrsMessResult: .quad sMessResult qAdrTableNumber: .quad TableNumber qAdrszMessSortOk: .quad szMessSortOk qAdrszMessSortNok: .quad szMessSortNok /******************************************************************/ /* control sorted table */ /******************************************************************/ /* x0 contains the address of table */ /* x1 contains the number of elements > 0 */ /* x0 return 0 if not sorted 1 if sorted */ isSorted: stp x2,lr,[sp,-16]! // save registers stp x3,x4,[sp,-16]! // save registers mov x2,0 ldr x4,[x0,x2,lsl 3] 1: add x2,x2,1 cmp x2,x1 bge 99f ldr x3,[x0,x2, lsl 3] cmp x3,x4 blt 98f mov x4,x3 b 1b 98: mov x0,0 // not sorted b 100f 99: mov x0,1 // sorted 100: ldp x3,x4,[sp],16 // restaur 2 registers ldp x2,lr,[sp],16 // restaur 2 registers ret // return to address lr x30 /******************************************************************/ /* selection sort */ /******************************************************************/ /* x0 contains the address of table */ /* x1 contains the first element */ /* x2 contains the number of element */ selectionSort: stp x1,lr,[sp,-16]! // save registers stp x2,x3,[sp,-16]! // save registers stp x4,x5,[sp,-16]! // save registers stp x6,x7,[sp,-16]! // save registers mov x3,x1 // start index i sub x7,x2,1 // compute n - 1 1: // start loop mov x4,x3 add x5,x3,1 // init index 2 2: ldr x1,[x0,x4,lsl 3] // load value A[mini] ldr x6,[x0,x5,lsl 3] // load value A[j] cmp x6,x1 // compare value csel x4,x5,x4,lt // j -> mini add x5,x5,1 // increment index j cmp x5,x2 // end ? blt 2b // no -> loop cmp x4,x3 // mini <> j ? beq 3f // no ldr x1,[x0,x4,lsl 3] // yes swap A[i] A[mini] ldr x6,[x0,x3,lsl 3] str x1,[x0,x3,lsl 3] str x6,[x0,x4,lsl 3] 3: add x3,x3,1 // increment i cmp x3,x7 // end ? blt 1b // no -> loop 100: ldp x6,x7,[sp],16 // restaur 2 registers ldp x4,x5,[sp],16 // restaur 2 registers ldp x2,x3,[sp],16 // restaur 2 registers ldp x1,lr,[sp],16 // restaur 2 registers ret // return to address lr x30 /******************************************************************/ /* Display table elements */ /******************************************************************/ /* x0 contains the address of table */ displayTable: stp x1,lr,[sp,-16]! // save registers stp x2,x3,[sp,-16]! // save registers mov x2,x0 // table address mov x3,0 1: // loop display table ldr x0,[x2,x3,lsl 3] ldr x1,qAdrsZoneConv bl conversion10 // décimal conversion ldr x0,qAdrsMessResult ldr x1,qAdrsZoneConv bl strInsertAtCharInc // insert result at @ character bl affichageMess // display message add x3,x3,1 cmp x3,NBELEMENTS - 1 ble 1b ldr x0,qAdrszCarriageReturn bl affichageMess 100: ldp x2,x3,[sp],16 // restaur 2 registers ldp x1,lr,[sp],16 // restaur 2 registers ret // return to address lr x30 /********************************************************/ /* File Include fonctions */ /********************************************************/ /* for this file see task include a file in language AArch64 assembly */ .include "../includeARM64.inc"</pre></div> <h2><a href="/wiki/Category:Action!" title="Category:Action!">Action!</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>PROC PrintArray(INT ARRAY a INT size) INT i Put('[) FOR i=0 TO size-1 DO IF i>0 THEN Put(' ) FI PrintI(a(i)) OD Put(']) PutE() RETURN PROC SelectionSort(INT ARRAY a INT size) INT i,j,minpos,tmp FOR i=0 TO size-2 DO minpos=i FOR j=i+1 TO size-1 DO IF a(minpos)>a(j) THEN minpos=j FI OD IF minpos#i THEN tmp=a(i) a(i)=a(minpos) a(minpos)=tmp FI OD RETURN PROC Test(INT ARRAY a INT size) PrintE("Array before sort:") PrintArray(a,size) SelectionSort(a,size) PrintE("Array after sort:") PrintArray(a,size) PutE() RETURN PROC Main() INT ARRAY a(10)=[1 4 65535 0 3 7 4 8 20 65530], b(21)=[10 9 8 7 6 5 4 3 2 1 0 65535 65534 65533 65532 65531 65530 65529 65528 65527 65526], c(8)=[101 102 103 104 105 106 107 108], d(12)=[1 65535 1 65535 1 65535 1 65535 1 65535 1 65535] Test(a,10) Test(b,21) Test(c,8) Test(d,12) RETURN</pre></div> <div> <dl><dt>Output:</dt></dl></div> <a rel="nofollow" class="external text" href="https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Selection_sort.png">Screenshot from Atari 8-bit computer</a> <pre>Array before sort: [1 4 -1 0 3 7 4 8 20 -6] Array after sort: [-6 -1 0 1 3 4 4 7 8 20] Array before sort: [10 9 8 7 6 5 4 3 2 1 0 -1 -2 -3 -4 -5 -6 -7 -8 -9 -10] Array after sort: [-10 -9 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10] Array before sort: [101 102 103 104 105 106 107 108] Array after sort: [101 102 103 104 105 106 107 108] Array before sort: [1 -1 1 -1 1 -1 1 -1 1 -1 1 -1] Array after sort: [-1 -1 -1 -1 -1 -1 1 1 1 1 1 1] </pre> <h2><a href="/wiki/Category:ActionScript" title="Category:ActionScript">ActionScript</a> </h2> <div class="mw-highlight mw-highlight-lang-actionscript mw-content-ltr" dir="ltr"><pre>function selectionSort(input: Array):Array { //find the i'th element for (var i:uint = 0; i < input.length; i++) { //set minIndex to an arbitrary value var minIndex:uint=i; //find the smallest number for (var j:uint = i; j < input.length; j++) { if (input[j]<input[minIndex]) { minIndex=j; } } //swap the smallest number into place var tmp:Number=input[i]; input[i]=input[minIndex]; input[minIndex]=tmp; } return input; } </pre></div> <h2><a href="/wiki/Category:Ada" title="Category:Ada">Ada</a> </h2> <div class="mw-highlight mw-highlight-lang-ada mw-content-ltr" dir="ltr"><pre>with Ada.Text_IO; use Ada.Text_IO; procedure Test_Selection_Sort is type Integer_Array is array (Positive range <>) of Integer; procedure Sort (A : in out Integer_Array) is Min : Positive; Temp : Integer; begin for I in A'First..A'Last - 1 loop Min := I; for J in I + 1..A'Last loop if A (Min) > A (J) then Min := J; end if; end loop; if Min /= I then Temp := A (I); A (I) := A (Min); A (Min) := Temp; end if; end loop; end Sort; A : Integer_Array := (4, 9, 3, -2, 0, 7, -5, 1, 6, 8); begin Sort (A); for I in A'Range loop Put (Integer'Image (A (I)) & " "); end loop; end Test_Selection_Sort; </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>-5 -2 0 1 3 4 6 7 8 9 </pre> <h2><a href="/wiki/Category:ALGOL_68" title="Category:ALGOL 68">ALGOL 68</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Ada">Ada</a></div> <div class="examplemeta workswith">Works with: <a href="/wiki/ALGOL_68" class="mw-redirect" title="ALGOL 68">ALGOL 68</a> version Standard - no extensions to language used</div> <div class="examplemeta workswith">Works with: <a href="/wiki/ALGOL_68G" class="mw-redirect" title="ALGOL 68G">ALGOL 68G</a> version Any - tested with release mk15-0.8b.fc9.i386</div> <div class="examplemeta workswith">Works with: <a href="/wiki/ELLA_ALGOL_68" class="mw-redirect" title="ELLA ALGOL 68">ELLA ALGOL 68</a> version Any (with appropriate job cards) - tested with release 1.8.8d.fc9.i386</div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>MODE DATA = REF CHAR; PROC in place selection sort = (REF[]DATA a)VOID: BEGIN INT min; DATA temp; FOR i FROM LWB a TO UPB a DO min := i; FOR j FROM i + 1 TO UPB a DO IF a [min] > a [j] THEN min := j FI OD; IF min /= i THEN temp  := a [i]; a [i]  := a [min]; a [min] := temp FI OD END # in place selection sort #; [32]CHAR data := "big fjords vex quick waltz nymph"; [UPB data]DATA ref data; FOR i TO UPB data DO ref data[i] := data[i] OD; in place selection sort(ref data); FOR i TO UPB ref data DO print(ref data[i]) OD; print(new line); print((data))</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre> abcdefghiijklmnopqrstuvwxyz big fjords vex quick waltz nymph </pre> <h2><a href="/wiki/Category:AppleScript" title="Category:AppleScript">AppleScript</a> </h2> <div class="mw-highlight mw-highlight-lang-applescript mw-content-ltr" dir="ltr"><pre>on selectionSort(theList, l, r) -- Sort items l thru r of theList in place. set listLength to (count theList) if (listLength < 2) then return -- Convert negative and/or transposed range indices. if (l < 0) then set l to listLength + l + 1 if (r < 0) then set r to listLength + r + 1 if (l > r) then set {l, r} to {r, l} script o property lst : theList end script repeat with i from l to (r - 1) set iVal to o's lst's item i set minVal to iVal set minPos to i repeat with j from (i + 1) to r set jVal to o's lst's item j if (minVal > jVal) then set minVal to jVal set minPos to j end if end repeat set o's lst's item minPos to iVal set o's lst's item i to minVal end repeat return -- nothing. end selectionSort property sort : selectionSort on demo() set theList to {988, 906, 151, 71, 712, 177, 945, 558, 31, 627} sort(theList, 1, -1) return theList end demo demo() </pre></div> <div> <dl><dt>Output:</dt></dl></div> <div class="mw-highlight mw-highlight-lang-applescript mw-content-ltr" dir="ltr"><pre>{31, 71, 151, 177, 558, 627, 712, 906, 945, 988} </pre></div> <h2><a href="/wiki/Category:ARM_Assembly" title="Category:ARM Assembly">ARM Assembly</a> </h2> <div class="examplemeta workswith">Works with: <a href="/wiki/As?action=edit&redlink=1" class="new" title="As (page does not exist)">as</a> version Raspberry Pi</div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>/* ARM assembly Raspberry PI */ /* program selectionSort.s */ /************************************/ /* Constantes */ /************************************/ .equ STDOUT, 1 @ Linux output console .equ EXIT, 1 @ Linux syscall .equ WRITE, 4 @ Linux syscall /*********************************/ /* Initialized data */ /*********************************/ .data szMessSortOk: .asciz "Table sorted.\n" szMessSortNok: .asciz "Table not sorted !!!!!.\n" sMessResult: .ascii "Value  : " sMessValeur: .fill 11, 1, ' ' @ size => 11 szCarriageReturn: .asciz "\n" .align 4 iGraine: .int 123456 .equ NBELEMENTS, 10 #TableNumber: .int 1,3,6,2,5,9,10,8,4,7 TableNumber: .int 10,9,8,7,6,5,4,3,2,1 /*********************************/ /* UnInitialized data */ /*********************************/ .bss /*********************************/ /* code section */ /*********************************/ .text .global main main: @ entry of program 1: ldr r0,iAdrTableNumber @ address number table mov r1,#0 mov r2,#NBELEMENTS @ number of élements bl selectionSort ldr r0,iAdrTableNumber @ address number table bl displayTable ldr r0,iAdrTableNumber @ address number table mov r1,#NBELEMENTS @ number of élements bl isSorted @ control sort cmp r0,#1 @ sorted ? beq 2f ldr r0,iAdrszMessSortNok @ no !! error sort bl affichageMess b 100f 2: @ yes ldr r0,iAdrszMessSortOk bl affichageMess 100: @ standard end of the program mov r0, #0 @ return code mov r7, #EXIT @ request to exit program svc #0 @ perform the system call iAdrsMessValeur: .int sMessValeur iAdrszCarriageReturn: .int szCarriageReturn iAdrsMessResult: .int sMessResult iAdrTableNumber: .int TableNumber iAdrszMessSortOk: .int szMessSortOk iAdrszMessSortNok: .int szMessSortNok /******************************************************************/ /* control sorted table */ /******************************************************************/ /* r0 contains the address of table */ /* r1 contains the number of elements > 0 */ /* r0 return 0 if not sorted 1 if sorted */ isSorted: push {r2-r4,lr} @ save registers mov r2,#0 ldr r4,[r0,r2,lsl #2] 1: add r2,#1 cmp r2,r1 movge r0,#1 bge 100f ldr r3,[r0,r2, lsl #2] cmp r3,r4 movlt r0,#0 blt 100f mov r4,r3 b 1b 100: pop {r2-r4,lr} bx lr @ return /******************************************************************/ /* selection sort */ /******************************************************************/ /* r0 contains the address of table */ /* r1 contains the first element */ /* r2 contains the number of element */ selectionSort: push {r1-r7,lr} @ save registers mov r3,r1 @ start index i sub r7,r2,#1 @ compute n - 1 1: @ start loop mov r4,r3 add r5,r3,#1 @ init index 2 2: ldr r1,[r0,r4,lsl #2] @ load value A[mini] ldr r6,[r0,r5,lsl #2] @ load value A[j] cmp r6,r1 @ compare value movlt r4,r5 @ j -> mini add r5,#1 @ increment index j cmp r5,r2 @ end ? blt 2b @ no -> loop cmp r4,r3 @ mini <> j ? beq 3f @ no ldr r1,[r0,r4,lsl #2] @ yes swap A[i] A[mini] ldr r6,[r0,r3,lsl #2] str r1,[r0,r3,lsl #2] str r6,[r0,r4,lsl #2] 3: add r3,#1 @ increment i cmp r3,r7 @ end ? blt 1b @ no -> loop 100: pop {r1-r7,lr} bx lr @ return /******************************************************************/ /* Display table elements */ /******************************************************************/ /* r0 contains the address of table */ displayTable: push {r0-r3,lr} @ save registers mov r2,r0 @ table address mov r3,#0 1: @ loop display table ldr r0,[r2,r3,lsl #2] ldr r1,iAdrsMessValeur @ display value bl conversion10 @ call function ldr r0,iAdrsMessResult bl affichageMess @ display message add r3,#1 cmp r3,#NBELEMENTS - 1 ble 1b ldr r0,iAdrszCarriageReturn bl affichageMess 100: pop {r0-r3,lr} bx lr /******************************************************************/ /* display text with size calculation */ /******************************************************************/ /* r0 contains the address of the message */ affichageMess: push {r0,r1,r2,r7,lr} @ save registres mov r2,#0 @ counter length 1: @ loop length calculation ldrb r1,[r0,r2] @ read octet start position + index cmp r1,#0 @ if 0 its over addne r2,r2,#1 @ else add 1 in the length bne 1b @ and loop @ so here r2 contains the length of the message mov r1,r0 @ address message in r1 mov r0,#STDOUT @ code to write to the standard output Linux mov r7, #WRITE @ code call system "write" svc #0 @ call systeme pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */ bx lr @ return /******************************************************************/ /* Converting a register to a decimal unsigned */ /******************************************************************/ /* r0 contains value and r1 address area */ /* r0 return size of result (no zero final in area) */ /* area size => 11 bytes */ .equ LGZONECAL, 10 conversion10: push {r1-r4,lr} @ save registers mov r3,r1 mov r2,#LGZONECAL 1: @ start loop bl divisionpar10U @ unsigned r0 <- dividende. quotient ->r0 reste -> r1 add r1,#48 @ digit strb r1,[r3,r2] @ store digit on area cmp r0,#0 @ stop if quotient = 0 subne r2,#1 @ else previous position bne 1b @ and loop @ and move digit from left of area mov r4,#0 2: ldrb r1,[r3,r2] strb r1,[r3,r4] add r2,#1 add r4,#1 cmp r2,#LGZONECAL ble 2b @ and move spaces in end on area mov r0,r4 @ result length mov r1,#' ' @ space 3: strb r1,[r3,r4] @ store space in area add r4,#1 @ next position cmp r4,#LGZONECAL ble 3b @ loop if r4 <= area size 100: pop {r1-r4,lr} @ restaur registres bx lr @return /***************************************************/ /* division par 10 unsigned */ /***************************************************/ /* r0 dividende */ /* r0 quotient */ /* r1 remainder */ divisionpar10U: push {r2,r3,r4, lr} mov r4,r0 @ save value //mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3 //movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3 ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2 umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3 add r2,r0,r0, lsl #2 @ r2 <- r0 * 5 sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10) pop {r2,r3,r4,lr} bx lr @ leave function iMagicNumber: .int 0xCCCCCCCD</pre></div> <h2><a href="/wiki/Category:Arturo" title="Category:Arturo">Arturo</a> </h2> <div class="mw-highlight mw-highlight-lang-rebol mw-content-ltr" dir="ltr"><pre>selectionSort: function [items][ sorted: new [] tmp: new items while [not? empty? tmp][ minIndex: index tmp min tmp 'sorted ++ tmp\[minIndex] remove 'tmp .index minIndex ] return sorted ] print selectionSort [3 1 2 8 5 7 9 4 6] </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>1 2 3 4 5 6 7 8 9</pre> <h2><a href="/wiki/Category:AutoHotkey" title="Category:AutoHotkey">AutoHotkey</a> </h2> ahk forum: <a rel="nofollow" class="external text" href="http://www.autohotkey.com/forum/topic44657-105.html">discussion</a> <div class="mw-highlight mw-highlight-lang-autohotkey mw-content-ltr" dir="ltr"><pre>MsgBox % SelecSort("") MsgBox % SelecSort("xxx") MsgBox % SelecSort("3,2,1") MsgBox % SelecSort("dog,000000,xx,cat,pile,abcde,1,cat,zz,xx,z") SelecSort(var) {  ; SORT COMMA SEPARATED LIST StringSplit a, var, `,  ; make array, size = a0 Loop % a0-1 { i := A_Index, mn := a%i%, j := m := i Loop % a0-i {  ; find minimum j++ If (a%j% < mn) mn := a%j%, m := j } t := a%i%, a%i% := a%m%, a%m% := t ; swap first with minimum } Loop % a0  ; construct string from sorted array sorted .= "," . a%A_Index% Return SubStr(sorted,2)  ; drop leading comma } </pre></div> <h2><a href="/wiki/Category:AWK" title="Category:AWK">AWK</a> </h2> <div class="mw-highlight mw-highlight-lang-awk mw-content-ltr" dir="ltr"><pre>function getminindex(gl, gi, gs) { min = gl[gi] gm = gi for(gj=gi; gj <= gs; gj++) { if ( gl[gj] < min ) { min = gl[gj] gm = gj } } return gm } { line[NR] = $0 } END { # sort it with selection sort for(i=1; i <= NR; i++) { mi = getminindex(line, i, NR) t = line[i] line[i] = line[mi]; line[mi] = t } #print it for(i=1; i <= NR; i++) { print line[i] } } </pre></div> <h2><a href="/wiki/Category:BBC_BASIC" title="Category:BBC BASIC">BBC BASIC</a> </h2> <div class="mw-highlight mw-highlight-lang-bbcbasic mw-content-ltr" dir="ltr"><pre>DEF PROC_SelectionSort(Size%) FOR I% = 1 TO Size%-1 lowest% = I% FOR J% = (I% + 1) TO Size% IF data%(J%) < data%(lowest%) lowest% = J% NEXT J% IF I%<>lowest% SWAP data%(I%),data%(lowest%) NEXT I% ENDPROC </pre></div> <h2><a href="/wiki/Category:BASIC" title="Category:BASIC">BASIC</a> </h2> <h3><a href="/wiki/Category:GWBASIC?action=edit&redlink=1" class="new" title="Category:GWBASIC (page does not exist)">GWBASIC</a> </h3> Works with: QBASIC, QuickBASIC, VB-DOS <div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>10 'SAVE"SELSORT",A 20 ' Selection Sort Algorithm 30 ' 40 ' VAR 50 DEFINT A-Z 60 OPTION BASE 1 70 I=0: J=0: IMINV = 0: IMAX = 0: TP! = 0: TL! = 0 80 ' 90 CLS 100 PRINT "This program does the Selection Sort Algorithm" 110 INPUT "Number of elements to sort (Max=1000, Enter=10)";IMAX 120 IF IMAX = 0 THEN IMAX = 10 130 IF IMAX > 1000 THEN IMAX = 1000 140 DIM N(IMAX) 150 ' Creates and shows the unsorted list 160 RANDOMIZE TIMER 170 FOR I=1 TO IMAX: N(I) = I: NEXT I 180 FOR I=1 TO IMAX 190 J = INT(RND*IMAX)+1 200 SWAP N(I), N(J) 210 NEXT I 220 PRINT: PRINT "Unsorted list:"; 230 FOR I=1 TO IMAX: PRINT N(I);: NEXT I 240 PRINT: PRINT 250 ' Sorts the list through the Selection Sort Algorithm and shows the results 260 TL! = TIMER 270 PRINT "Sorting"; IMAX; "numbers"; 280 COLOR 7+16: X = POS(0): PRINT"...";: COLOR 7 290 ITP = 0 300 FOR I=1 TO IMAX-1 310 IMINV = I 320 FOR J=I+1 TO IMAX 330 IF N(IMINV)>N(J) THEN IMINV = J 340 NEXT J 350 IF IMINV>I THEN SWAP N(IMINV), N(I): TP! = TP! + 1 360 NEXT I 370 LOCATE ,X: PRINT ". Done!" 380 PRINT: PRINT "Sorted list:"; 390 FOR I=1 TO IMAX: PRINT N(I);: NEXT I 400 ' Final results 410 PRINT: PRINT: PRINT "Numbers sorted:"; IMAX 420 PRINT "Total permutations done:";TP! 430 PRINT "Time lapse:"; TIMER-TL!; "seconds." 440 PRINT 450 PRINT "End of program" 460 END </pre></div> <h3><a href="/wiki/Category:IS-BASIC" title="Category:IS-BASIC">IS-BASIC</a> </h3> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>100 PROGRAM "SelecSrt.bas" 110 RANDOMIZE 120 NUMERIC ARRAY(-5 TO 14) 130 CALL INIT(ARRAY) 140 CALL WRITE(ARRAY) 150 CALL SELECTIONSORT(ARRAY) 160 CALL WRITE(ARRAY) 170 DEF INIT(REF A) 180 FOR I=LBOUND(A) TO UBOUND(A) 190 LET A(I)=RND(98)+1 200 NEXT 210 END DEF 220 DEF WRITE(REF A) 230 FOR I=LBOUND(A) TO UBOUND(A) 240 PRINT A(I); 250 NEXT 260 PRINT 270 END DEF 280 DEF SELECTIONSORT(REF A) 290 FOR I=LBOUND(A) TO UBOUND(A)-1 300 LET MN=A(I):LET INDEX=I 310 FOR J=I+1 TO UBOUND(A) 320 IF MN>A(J) THEN LET MN=A(J):LET INDEX=J 330 NEXT 340 LET A(INDEX)=A(I):LET A(I)=MN 350 NEXT 360 END DEF</pre></div> <h2><a href="/wiki/Category:BCPL" title="Category:BCPL">BCPL</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>get "libhdr" let selectionsort(A, len) be if len > 1 $( let minloc = A and t = ? for i=0 to len-1 if !minloc > A!i do minloc := A+i t := !A !A := !minloc !minloc := t selectionsort(A+1, len-1) $) let writearray(A, len) be for i=0 to len-1 do writed(A!i, 6) let start() be $( let array = table 52, -5, -20, 199, 65, -3, 190, 25, 9999, -5342 let length = 10 writes("Input: ") ; writearray(array, length) ; wrch('*N') selectionsort(array, length) writes("Output: ") ; writearray(array, length) ; wrch('*N') $)</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Input: 52 -5 -20 199 65 -3 190 25 9999 -5342 Output: -5342 -20 -5 -3 25 52 65 190 199 9999</pre> <h2><a href="/wiki/Category:C" title="Category:C">C</a> </h2> <div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>#include <stdio.h> void selection_sort (int *a, int n) { int i, j, m, t; for (i = 0; i < n; i++) { for (j = i, m = i; j < n; j++) { if (a[j] < a[m]) { m = j; } } t = a[i]; a[i] = a[m]; a[m] = t; } } int main () { int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1}; int n = sizeof a / sizeof a[0]; int i; for (i = 0; i < n; i++) printf("%d%s", a[i], i == n - 1 ? "\n" : " "); selection_sort(a, n); for (i = 0; i < n; i++) printf("%d%s", a[i], i == n - 1 ? "\n" : " "); return 0; } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>4 65 2 -31 0 99 2 83 782 1 -31 0 1 2 2 4 65 83 99 782 </pre> <h2><a href="/wiki/Category:C_sharp" title="Category:C sharp">C#</a> </h2> This is a generic implementation that works with any type that implements the IComparable interface <div class="mw-highlight mw-highlight-lang-csharp mw-content-ltr" dir="ltr"><pre>class SelectionSort<T> where T : IComparable { public T[] Sort(T[] list) { int k; T temp; for (int i = 0; i < list.Length; i++) { k = i; for (int j=i + 1; j < list.Length; j++) { if (list[j].CompareTo(list[k]) < 0) { k = j; } } temp = list[i]; list[i] = list[k]; list[k] = temp; } return list; } } </pre></div> Example of usage: <div class="mw-highlight mw-highlight-lang-csharp mw-content-ltr" dir="ltr"><pre>String[] str = { "this", "is", "a", "test", "of", "generic", "selection", "sort" }; SelectionSort<String> mySort = new SelectionSort<string>(); String[] result = mySort.Sort(str); for (int i = 0; i < result.Length; i++) { Console.WriteLine(result[i]); } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>a generic is of selection sort test this</pre> <h2><a href="/wiki/Category:C%2B%2B" title="Category:C++">C++</a> </h2> Uses C++11. Compile with <pre>g++ -std=c++11 selection.cpp </pre> <div class="mw-highlight mw-highlight-lang-cpp mw-content-ltr" dir="ltr"><pre>#include <algorithm> #include <iterator> #include <iostream> template<typename ForwardIterator> void selection_sort(ForwardIterator begin, ForwardIterator end) { for(auto i = begin; i != end; ++i) { std::iter_swap(i, std::min_element(i, end)); } } int main() { int a[] = {100, 2, 56, 200, -52, 3, 99, 33, 177, -199}; selection_sort(std::begin(a), std::end(a)); copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " ")); std::cout << "\n"; } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>-199 -52 2 3 33 56 99 100 177 200 </pre> <h2><a href="/wiki/Category:Clojure" title="Category:Clojure">Clojure</a> </h2> This is an implementation that mutates a Java arraylist in place. <div class="mw-highlight mw-highlight-lang-lisp mw-content-ltr" dir="ltr"><pre>(import 'java.util.ArrayList) (defn arr-swap! [#^ArrayList arr i j] (let [t (.get arr i)] (doto arr (.set i (.get arr j)) (.set j t)))) (defn sel-sort! ([arr] (sel-sort! compare arr)) ([cmp #^ArrayList arr] (let [n (.size arr)] (letfn [(move-min! [start-i] (loop [i start-i] (when (< i n) (when (< (cmp (.get arr i) (.get arr start-i)) 0) (arr-swap! arr start-i i)) (recur (inc i)))))] (doseq [start-i (range (dec n))] (move-min! start-i)) arr)))) </pre></div> <h2><a href="/wiki/Category:COBOL" title="Category:COBOL">COBOL</a> </h2> <div class="mw-highlight mw-highlight-lang-cobol mw-content-ltr" dir="ltr"><pre> PERFORM E-SELECTION VARYING WB-IX-1 FROM 1 BY 1 UNTIL WB-IX-1 = WC-SIZE. ... E-SELECTION SECTION. E-000. SET WC-LOWEST TO WB-IX-1. ADD 1 WC-LOWEST GIVING WC-START PERFORM F-PASS VARYING WB-IX-2 FROM WC-START BY 1 UNTIL WB-IX-2 > WC-SIZE. IF WB-IX-1 NOT = WC-LOWEST MOVE WB-ENTRY(WC-LOWEST) TO WC-TEMP MOVE WB-ENTRY(WB-IX-1) TO WB-ENTRY(WC-LOWEST) MOVE WC-TEMP TO WB-ENTRY(WB-IX-1). E-999. EXIT. F-PASS SECTION. F-000. IF WB-ENTRY(WB-IX-2) < WB-ENTRY(WC-LOWEST) SET WC-LOWEST TO WB-IX-2. F-999. EXIT. </pre></div> <h2><a href="/wiki/Category:Common_Lisp" title="Category:Common Lisp">Common Lisp</a> </h2> <div class="mw-highlight mw-highlight-lang-lisp mw-content-ltr" dir="ltr"><pre>(defun selection-sort-vector (array predicate) (do ((length (length array)) (i 0 (1+ i))) ((eql i length) array) (do ((mindex i) (min (aref array i)) (j i (1+ j))) ((eql j length) (rotatef (aref array i) (aref array mindex))) (when (funcall predicate (aref array j) min) (setf min (aref array j) mindex j))))) (defun selection-sort-list (list predicate) (flet ((min-first (list) (do ((before-min nil) (min (first list)) (prev list (rest prev)) (curr (rest list) (rest curr))) ((endp curr) (if (null before-min) list (let ((min (cdr before-min))) (rplacd before-min (cdr min)) (rplacd min list) min))) (when (funcall predicate (first curr) min) (setf before-min prev min (first curr)))))) (let ((result (min-first list))) (do ((head result (rest head))) ((endp (rest head)) result) (rplacd head (min-first (rest head))))))) (defun selection-sort (sequence predicate) (etypecase sequence (list (selection-sort-list sequence predicate)) (vector (selection-sort-vector sequence predicate)))) </pre></div> Example use: <pre>> (selection-sort (list 8 7 4 3 2 0 9 1 5 6) '<) (0 1 2 3 4 5 6 7 8 9) > (selection-sort (vector 8 7 4 3 2 0 9 1 5 6) '>) #(9 8 7 6 5 4 3 2 1 0)</pre> <h2><a href="/wiki/Category:Crystal" title="Category:Crystal">Crystal</a> </h2> This sorts the array in-place. <div class="mw-highlight mw-highlight-lang-crystal mw-content-ltr" dir="ltr"><pre>def selectionSort(array : Array) (0...array.size-1).each do |i| nextMinIndex = i (i+1...array.size).each do |j| if array[j] < array[nextMinIndex] nextMinIndex = j end end if i != nextMinIndex array.swap(i, nextMinIndex) end end end </pre></div> <h2><a href="/wiki/Category:D" title="Category:D">D</a> </h2> The actual function is very short. <div class="mw-highlight mw-highlight-lang-d mw-content-ltr" dir="ltr"><pre>import std.stdio, std.algorithm, std.array, std.traits; enum AreSortableArrayItems(T) = isMutable!T && __traits(compiles, T.init < T.init) && !isNarrowString!(T[]); void selectionSort(T)(T[] data) if (AreSortableArrayItems!T) { foreach (immutable i, ref d; data) data.drop(i).minPos[0].swap(d); } unittest { int[] a0; a0.selectionSort; auto a1 = [1]; a1.selectionSort; assert(a1 == [1]); auto a2 = ["a", "b"]; a2.selectionSort; assert(a2 == ["a", "b"]); auto a3 = ["b", "a"]; a3.selectionSort; assert(a3 == ["a", "b"]); auto a4 = ['a', 'b']; static assert(!__traits(compiles, a4.selectionSort)); dchar[] a5 = ['b', 'a']; a5.selectionSort; assert(a5 == "ab"d); import std.typecons; alias Nullable!int N; auto a6 = [N(2), N(1)]; a6.selectionSort; // Not nothrow. assert(a6 == [N(1), N(2)]); auto a7 = [1.0+0i, 2.0+0i]; // To be deprecated. static assert(!__traits(compiles, a7.selectionSort)); import std.complex; auto a8 = [complex(1), complex(2)]; static assert(!__traits(compiles, a8.selectionSort)); static struct F { int x; int opCmp(F f) { // Not pure. return x < f.x ? -1 : (x > f.x ? 1 : 0); } } auto a9 = [F(2), F(1)]; a9.selectionSort; assert(a9 == [F(1), F(2)]); } void main() { auto a = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9, 3, 2]; a.selectionSort; a.writeln; } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>[1, 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9]</pre> <h2><a href="/wiki/Category:Dart" title="Category:Dart">Dart</a> </h2> <div class="examplemeta translation">Translation of: <a href="#_Java"> Java</a></div> <div class="mw-highlight mw-highlight-lang-dart mw-content-ltr" dir="ltr"><pre>void main() { List<int> a = selectionSort([1100, 2, 56, 200, -52, 3, 99, 33, 177, -199]); print('$a'); } selectionSort(List<int> array){ for(int currentPlace = 0;currentPlace<array.length-1;currentPlace++){ int smallest = 4294967296; //maxInt int smallestAt = currentPlace+1; for(int check = currentPlace; check<array.length;check++){ if(array[check]<smallest){ smallestAt = check; smallest = array[check]; } } int temp = array[currentPlace]; array[currentPlace] = array[smallestAt]; array[smallestAt] = temp; } return array; } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre> unsorted array: [1100, 2, 56, 200, -52, 3, 99, 33, 177, -199] a sorted: [-199, -52, 2, 3, 33, 56, 99, 177, 200, 1100] </pre> <h2><a href="/wiki/Category:Delphi" title="Category:Delphi">Delphi</a> </h2> <h3>Array sort</h3> Dynamic array is a 0-based array of variable length Static array is an arbitrary-based array of fixed length <div class="mw-highlight mw-highlight-lang-delphi mw-content-ltr" dir="ltr"><pre>program TestSelectionSort; {$APPTYPE CONSOLE} {.$DEFINE DYNARRAY} // remove '.' to compile with dynamic array type TItem = Integer; // declare ordinal type for array item {$IFDEF DYNARRAY} TArray = array of TItem; // dynamic array {$ELSE} TArray = array[0..15] of TItem; // static array {$ENDIF} procedure SelectionSort(var A: TArray); var Item: TItem; I, J, M: Integer; begin for I:= Low(A) to High(A) - 1 do begin M:= I; for J:= I + 1 to High(A) do if A[J] < A[M] then M:= J; Item:= A[M]; A[M]:= A[I]; A[I]:= Item; end; end; var A: TArray; I: Integer; begin {$IFDEF DYNARRAY} SetLength(A, 16); {$ENDIF} for I:= Low(A) to High(A) do A[I]:= Random(100); for I:= Low(A) to High(A) do Write(A[I]:3); Writeln; SelectionSort(A); for I:= Low(A) to High(A) do Write(A[I]:3); Writeln; Readln; end. </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre> 0 3 86 20 27 67 31 16 37 42 8 47 7 84 5 29 0 3 5 7 8 16 20 27 29 31 37 42 47 67 84 86 </pre> <h3>String sort</h3> // string is 1-based variable-length array of Char <div class="mw-highlight mw-highlight-lang-delphi mw-content-ltr" dir="ltr"><pre>procedure SelectionSort(var S: string); var Lowest: Char; I, J, M, L: Integer; begin L:= Length(S); for I:= 1 to L - 1 do begin M:= I; for J:= I + 1 to L do if S[J] < S[M] then M:= J; Lowest:= S[M]; S[M]:= S[I]; S[I]:= Lowest; end; end; </pre></div> <pre>// in : S = 'the quick brown fox jumps over the lazy dog' // out: S = ' abcdeeefghhijklmnoooopqrrsttuuvwxyz' </pre> <h2><a href="/wiki/Category:E" title="Category:E">E</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>def selectionSort := { def cswap(c, a, b) { def t := c[a] c[a]  := c[b] c[b]  := t println(c) } def indexOfMin(array, first, last) { var min := array[first] var mini := first for i in (first+1)..last { if (array[i] < min) { min := array[i] mini := i } } return mini } /** Selection sort (in-place). */ def selectionSort(array) { def last := (array.size()-1) for i in 0..(last - 1) { cswap(array, i, indexOfMin(array, i + 1, last)) } } }</pre></div> <h2><a href="/wiki/Category:EasyLang" title="Category:EasyLang">EasyLang</a> </h2> <div class="mw-highlight mw-highlight-lang-text mw-content-ltr" dir="ltr"><pre>proc sort . d[] . for i = 1 to len d[] - 1 for j = i + 1 to len d[] if d[j] < d[i] swap d[j] d[i] . . . . data[] = [ 29 4 72 44 55 26 27 77 92 5 ] sort data[] print data[] </pre></div> <h2><a href="/wiki/Category:EchoLisp" title="Category:EchoLisp">EchoLisp</a> </h2> <h3>List sort</h3> <div class="mw-highlight mw-highlight-lang-scheme mw-content-ltr" dir="ltr"><pre>;; recursive version (adapted from Racket) (lib 'list) ;; list-delete (define (sel-sort xs (x0)) (cond [(null? xs) null] [else (set! x0 (apply min xs)) (cons x0 (sel-sort (list-delete xs x0)))])) (sel-sort (shuffle (iota 13))) → (0 1 2 3 4 5 6 7 8 9 10 11 12) ;; straightforward and more efficient implementation using list-swap! (define (sel-sort list) (maplist (lambda( L) (first (list-swap! L (first L) (apply min L )))) list)) (sel-sort (shuffle (iota 13))) → (0 1 2 3 4 5 6 7 8 9 10 11 12) </pre></div> <h3>Array sort</h3> <div class="mw-highlight mw-highlight-lang-scheme mw-content-ltr" dir="ltr"><pre>;; sort an array in place (define (sel-sort a (amin) (imin)) (define ilast (1- (vector-length a))) (for [(i ilast)] (set! amin [a (setv! imin i)]) ;; imin := i , amin := a[imin] (for [(j (in-range (1+ i) (1+ ilast)))] (when (< [a j] amin) (set! amin [a (setv! imin j)]))) (vector-swap! a i imin)) a ) (define a #(9 8 2 6 3 5 4)) (sel-sort a) → #( 2 3 4 5 6 8 9) </pre></div> <h2><a href="/wiki/Category:Eiffel" title="Category:Eiffel">Eiffel</a> </h2> <div class="mw-highlight mw-highlight-lang-eiffel mw-content-ltr" dir="ltr"><pre>class SELECTION_SORT [G -> COMPARABLE] feature {NONE} index_of_min (ar: ARRAY [G]; lower: INTEGER): INTEGER --Index of smallest element in 'ar' in the range of lower and the max index. require lower_positiv: lower >= 1 lower_in_range: lower <= ar.count ar_not_void: ar /= Void local i: INTEGER min: G do from i := lower min := ar.item (i) Result := i until i + 1 > ar.count loop if ar.item (i + 1) < min then min := ar.item (i + 1) Result := i + 1 end i := i + 1 end ensure result_is_set: Result /= Void end sort (ar: ARRAY [G]): ARRAY [G] -- sort array ar with selectionsort require ar_not_void: ar /= Void local min_index: INTEGER ith: G do create Result.make_empty Result.deep_copy (ar) across Result as ic loop min_index := index_of_min (Result, ic.cursor_index) ith := Result [ic.cursor_index] Result [ic.cursor_index] := Result [min_index] Result [min_index] := ith end ensure Result_is_set: Result /= Void Result_sorted: is_sorted (Result) = True end is_sorted (ar: ARRAY [G]): BOOLEAN --- Is 'ar' sorted in ascending order? require ar_not_empty: ar.is_empty = False local i: INTEGER do Result := True from i := ar.lower until i = ar.upper loop if ar [i] > ar [i + 1] then Result := False end i := i + 1 end end feature selectionsort (ar: ARRAY [G]): ARRAY [G] do Result := sort (ar) end end </pre></div> Test: <div class="mw-highlight mw-highlight-lang-eiffel mw-content-ltr" dir="ltr"><pre>class APPLICATION create make feature make do test := <<1, 27, 32, 99, 1, -7, 3, 5, 7>> io.put_string ("Unsorted: ") across test as ic loop io.put_string (ic.item.out + " ") end create selectionsort io.put_string ("%NSorted: ") test := selectionsort.selectionsort (test) across test as ar loop io.put_string (ar.item.out + " ") end end test: ARRAY [INTEGER] selectionsort: SELECTION_SORT [INTEGER] end </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Unsorted: 1 27 32 99 1 -7 3 5 7 Sorted: -7 1 1 3 5 7 27 32 99 </pre> <h2><a href="/wiki/Category:Elena" title="Category:Elena">Elena</a> </h2> ELENA 6.x : <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>import extensions; import system'routines; extension op { selectionSort() { var copy := self.clone(); for(int i := 0; i < copy.Length; i += 1) { int k := i; for(int j := i + 1; j < copy.Length; j += 1) { if (copy[j] < copy[k]) { k := j } }; copy.exchange(i,k) }; ^ copy } } public program() { var list := new string[]{"this", "is", "a", "test", "of", "generic", "selection", "sort"}; console.printLine("before:",list.asEnumerable()); console.printLine("after:",list.selectionSort().asEnumerable()) }</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>before:this,is,a,test,of,generic,selection,sort after:a,generic,is,of,selection,sort,test,this </pre> <h2><a href="/wiki/Category:Elixir" title="Category:Elixir">Elixir</a> </h2> <div class="mw-highlight mw-highlight-lang-elixir mw-content-ltr" dir="ltr"><pre>defmodule Sort do def selection_sort(list) when is_list(list), do: selection_sort(list, []) defp selection_sort([], sorted), do: sorted defp selection_sort(list, sorted) do max = Enum.max(list) selection_sort(List.delete(list, max), [max | sorted]) end end </pre></div> Example: <pre>iex(10)> Sort.selection_sort([5,3,9,4,1,6,8,2,7]) [1, 2, 3, 4, 5, 6, 7, 8, 9] </pre> <h2><a href="/wiki/Category:Erlang" title="Category:Erlang">Erlang</a> </h2> <div class="mw-highlight mw-highlight-lang-erlang mw-content-ltr" dir="ltr"><pre>-module(solution). -import(lists,[delete/2,max/1]). -compile(export_all). selection_sort([],Sort)-> Sort; selection_sort(Ar,Sort)-> M=max(Ar), Ad=delete(M,Ar), selection_sort(Ad,[M|Sort]). print_array([])->ok; print_array([H|T])-> io:format("~p~n",[H]), print_array(T). main()-> Ans=selection_sort([1,5,7,8,4,10],[]), print_array(Ans). </pre></div> <h2><a href="/wiki/Category:Euphoria" title="Category:Euphoria">Euphoria</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>function selection_sort(sequence s) object tmp integer m for i = 1 to length(s) do m = i for j = i+1 to length(s) do if compare(s[j],s[m]) < 0 then m = j end if end for tmp = s[i] s[i] = s[m] s[m] = tmp end for return s end function include misc.e constant s = {4, 15, "delta", 2, -31, 0, "alfa", 19, "gamma", 2, 13, "beta", 782, 1} puts(1,"Before: ") pretty_print(1,s,{2}) puts(1,"\nAfter: ") pretty_print(1,selection_sort(s),{2})</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Before: { 4, 15, "delta", 2, -31, 0, "alfa", 19, "gamma", 2, 13, "beta", 782, 1 } After: { -31, 0, 1, 2, 2, 4, 13, 15, 19, 782, "alfa", "beta", "delta", "gamma" }</pre> <h2><a href="/wiki/Category:F_Sharp" title="Category:F Sharp">F#</a> </h2> <div class="mw-highlight mw-highlight-lang-fsharp mw-content-ltr" dir="ltr"><pre>let rec ssort = function [] -> [] | x::xs -> let min, rest = List.fold (fun (min,acc) x -> if x<min then (x, min::acc) else (min, x::acc)) (x, []) xs in min::ssort rest </pre></div> <h2><a href="/wiki/Category:Factor" title="Category:Factor">Factor</a> </h2> <div class="mw-highlight mw-highlight-lang-factor mw-content-ltr" dir="ltr"><pre>USING: kernel math sequences sequences.extras ; : select ( m n seq -- ) [ dup ] 2dip [ <slice> [ ] infimum-by* drop over + ] [ exchange ] bi ; : selection-sort! ( seq -- seq' ) [ ] [ length dup ] [ ] tri [ select ] 2curry each-integer ; </pre></div> Example use <div class="mw-highlight mw-highlight-lang-factor mw-content-ltr" dir="ltr"><pre>IN: scratchpad { 5 -6 3 9 -2 4 -1 -6 5 -5 } selection-sort! --- Data stack: { -6 -6 -5 -2 -1 3 4 5 5 9 } </pre></div> <h2><a href="/wiki/Category:Forth" title="Category:Forth">Forth</a> </h2> <div class="mw-highlight mw-highlight-lang-forth mw-content-ltr" dir="ltr"><pre>defer less? ' < is less? : least ( start end -- least ) over cell+ do i @ over @ less? if drop i then cell +loop ; : selection ( array len -- ) cells over + tuck ( end start end ) cell- swap do ( end ) i over least ( end least ) i @ over @ i ! swap ! cell +loop drop ; create array 8 , 1 , 4 , 2 , 10 , 3 , 7 , 9 , 6 , 5 , array 10 selection array 10 cells dump </pre></div> <h2><a href="/wiki/Category:Fortran" title="Category:Fortran">Fortran</a> </h2> <div class="examplemeta workswith">Works with: <a href="/wiki/Fortran" class="mw-redirect" title="Fortran">Fortran</a> version 95 and later</div> <div class="mw-highlight mw-highlight-lang-fortran mw-content-ltr" dir="ltr"><pre>PROGRAM SELECTION IMPLICIT NONE INTEGER :: intArray(10) = (/ 4, 9, 3, -2, 0, 7, -5, 1, 6, 8 /) WRITE(*,"(A,10I5)") "Unsorted array:", intArray CALL Selection_sort(intArray) WRITE(*,"(A,10I5)") "Sorted array  :", intArray CONTAINS SUBROUTINE Selection_sort(a) INTEGER, INTENT(IN OUT) :: a(:) INTEGER :: i, minIndex, temp DO i = 1, SIZE(a)-1 minIndex = MINLOC(a(i:), 1) + i - 1 IF (a(i) > a(minIndex)) THEN temp = a(i) a(i) = a(minIndex) a(minIndex) = temp END IF END DO END SUBROUTINE Selection_sort END PROGRAM SELECTION </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Unsorted array: 4 9 3 -2 0 7 -5 1 6 8 Sorted array  : -5 -2 0 1 3 4 6 7 8 9 </pre> <h2><a href="/wiki/Category:FreeBASIC" title="Category:FreeBASIC">FreeBASIC</a> </h2> <div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>' version 03-12-2016 ' compile with: fbc -s console ' for boundry checks on array's compile with: fbc -s console -exx Sub selectionsort(arr() As Long) ' sort from lower bound to the highter bound ' array's can have subscript range from -2147483648 to +2147483647 Dim As Long i, j, x Dim As Long lb = LBound(arr) Dim As Long ub = UBound(arr) For i = lb To ub -1 x = i For j = i +1 To ub If arr(j) < arr(x) Then x = j Next If x <> i Then Swap arr(i), arr(x) End If Next End Sub ' ------=< MAIN >=------ Dim As Long i, array(-7 To 7) Dim As Long a = LBound(array), b = UBound(array) Randomize Timer For i = a To b : array(i) = i : Next For i = a To b ' little shuffle Swap array(i), array(Int(Rnd * (b - a +1)) + a) Next Print "unsort "; For i = a To b : Print Using "####"; array(i); : Next : Print selectionsort(array()) ' sort the array Print " sort "; For i = a To b : Print Using "####"; array(i); : Next : Print ' empty keyboard buffer While InKey <> "" : Wend Print : Print "hit any key to end program" Sleep End </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>unsort 1 -7 -5 -4 6 5 -3 4 2 0 3 -6 -2 7 -1 sort -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7</pre> <h2><a href="/wiki/Category:Gambas" title="Category:Gambas">Gambas</a> </h2> <div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>siLow As Short = -99 'Set the lowest value number to create siHigh As Short = 99 'Set the highest value number to create siQty As Short = 20 'Set the quantity of numbers to create Public Sub Main() Dim siToSort As Short[] = CreateNumbersToSort() Dim siPos, siLow, siChar, siCount As Short PrintOut("To sort: ", siToSort) For siCount = 0 To siToSort.Max siChar = siCount For siPos = siCount + 1 To siToSort.Max If siToSort[siChar] > siToSort[siPos] Then siChar = siPos Next siLow = siToSort[siChar] siToSort.Delete(siChar, 1) siToSort.Add(siLow, siCount) Next PrintOut(" Sorted: ", siToSort) End '--------------------------------------------------------- Public Sub PrintOut(sText As String, siToSort As String[]) Dim siCount As Short Print sText; For siCount = 0 To siToSort.Max Print siToSort[siCount]; If siCount <> siToSort.max Then Print ", "; Next Print End '--------------------------------------------------------- Public Sub CreateNumbersToSort() As Short[] Dim siCount As Short Dim siList As New Short[] For siCount = 0 To siQty siList.Add(Rand(siLow, siHigh)) Next Return siList End </pre></div> Output: <pre>To sort: -11, -64, -20, -84, 94, -60, -82, -82, 37, -30, -75, 73, 19, -97, 81, -26, 55, 8, -15, -31, 36 Sorted: -97, -84, -82, -82, -75, -64, -60, -31, -30, -26, -20, -15, -11, 8, 19, 36, 37, 55, 73, 81, 94 </pre> <h2><a href="/wiki/Category:GAP" title="Category:GAP">GAP</a> </h2> <div class="mw-highlight mw-highlight-lang-gap mw-content-ltr" dir="ltr"><pre>SelectionSort := function(v) local i, j, k, n, m; n := Size(v); for i in [1 .. n] do k := i; m := v[i]; for j in [i + 1 .. n] do if v[j] < m then k := j; m := v[j]; fi; od; v[k] := v[i]; v[i] := m; od; end; v := List([1 .. 100], n -> Random([1 .. 100])); SelectionSort(v); v; </pre></div> <h2><a href="/wiki/Category:Go" title="Category:Go">Go</a> </h2> <div class="mw-highlight mw-highlight-lang-go mw-content-ltr" dir="ltr"><pre>package main import "fmt" var a = []int{170, 45, 75, -90, -802, 24, 2, 66} func main() { fmt.Println("before:", a) selectionSort(a) fmt.Println("after: ", a) } func selectionSort(a []int) { last := len(a) - 1 for i := 0; i < last; i++ { aMin := a[i] iMin := i for j := i + 1; j < len(a); j++ { if a[j] < aMin { aMin = a[j] iMin = j } } a[i], a[iMin] = aMin, a[i] } } </pre></div> More generic version that sorts anything that implements <code>sort.Interface</code>: <div class="mw-highlight mw-highlight-lang-go mw-content-ltr" dir="ltr"><pre>package main import ( "sort" "fmt" ) var a = []int{170, 45, 75, -90, -802, 24, 2, 66} func main() { fmt.Println("before:", a) selectionSort(sort.IntSlice(a)) fmt.Println("after: ", a) } func selectionSort(a sort.Interface) { last := a.Len() - 1 for i := 0; i < last; i++ { iMin := i for j := i + 1; j < a.Len(); j++ { if a.Less(j, iMin) { iMin = j } } a.Swap(i, iMin) } } </pre></div> <h2><a href="/wiki/Category:Haskell" title="Category:Haskell">Haskell</a> </h2> <div class="mw-highlight mw-highlight-lang-haskell mw-content-ltr" dir="ltr"><pre>import Data.List (delete) selSort :: (Ord a) => [a] -> [a] selSort [] = [] selSort xs = selSort (delete x xs) ++ [x] where x = maximum xs </pre></div> <h2><a href="/wiki/Category:Haxe" title="Category:Haxe">Haxe</a> </h2> <div class="mw-highlight mw-highlight-lang-haxe mw-content-ltr" dir="ltr"><pre>class SelectionSort { @:generic public static function sort<T>(arr:Array<T>) { var len = arr.length; for (index in 0...len) { var minIndex = index; for (remainingIndex in (index+1)...len) { if (Reflect.compare(arr[minIndex], arr[remainingIndex]) > 0) minIndex = remainingIndex; } if (index != minIndex) { var temp = arr[index]; arr[index] = arr[minIndex]; arr[minIndex] = temp; } } } } class Main { static function main() { var integerArray = [1, 10, 2, 5, -1, 5, -19, 4, 23, 0]; var floatArray = [1.0, -3.2, 5.2, 10.8, -5.7, 7.3, 3.5, 0.0, -4.1, -9.5]; var stringArray = ['We', 'hold', 'these', 'truths', 'to', 'be', 'self-evident', 'that', 'all', 'men', 'are', 'created', 'equal']; Sys.println('Unsorted Integers:' + integerArray); SelectionSort.sort(integerArray); Sys.println('Sorted Integers: ' + integerArray); Sys.println('Unsorted Floats: ' + floatArray); SelectionSort.sort(floatArray); Sys.println('Sorted Floats: ' + floatArray); Sys.println('Unsorted Strings: ' + stringArray); SelectionSort.sort(stringArray); Sys.println('Sorted Strings: ' + stringArray); } } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Unsorted Integers: [1,10,2,5,-1,5,-19,4,23,0] Sorted Integers: [-19,-1,0,1,2,4,5,5,10,23] Unsorted Floats: [1,-3.2,5.2,10.8,-5.7,7.3,3.5,0,-4.1,-9.5] Sorted Floats: [-9.5,-5.7,-4.1,-3.2,0,1,3.5,5.2,7.3,10.8] Unsorted Strings: [We,hold,these,truths,to,be,self-evident,that,all,men,are,created,equal] Sorted Strings: [We,all,are,be,created,equal,hold,men,self-evident,that,these,to,truths] </pre> <h2><a href="/wiki/Category:Icon" title="Category:Icon">Icon</a> and <a href="/wiki/Category:Unicon" title="Category:Unicon">Unicon</a> </h2> <div class="mw-highlight mw-highlight-lang-icon mw-content-ltr" dir="ltr"><pre>procedure main() #: demonstrate various ways to sort a list and string demosort(selectionsort,[3, 14, 1, 5, 9, 2, 6, 3],"qwerty") end procedure selectionsort(X,op) #: return sorted list ascending(or descending) local i,m op := sortop(op,X) # select how and what we sort every i := 1 to *X-1 do { m := i every j := i + 1 to *X do if op(X[j],X[m]) then m := j # find X that belongs @i low (or high) X[m ~= i] :=: X[m] } return X end </pre></div> Note: This example relies on <a href="/wiki/Sorting_algorithms/Bubble_sort#Icon" title="Sorting algorithms/Bubble sort"> the supporting procedures 'sortop', and 'demosort' in Bubble Sort</a>. The full demosort exercises the named sort of a list with op = "numeric", "string", ">>" (lexically gt, descending),">" (numerically gt, descending), a custom comparator, and also a string. <div> <dl><dt>Output:</dt></dl></div> Abbreviated sample <pre>Sorting Demo using procedure selectionsort on list : [ 3 14 1 5 9 2 6 3 ] with op = &null: [ 1 2 3 3 5 6 9 14 ] (0 ms) ... on string : "qwerty" with op = &null: "eqrtwy" (0 ms)</pre> <h2><a href="/wiki/Category:Io" title="Category:Io">Io</a> </h2> <div class="mw-highlight mw-highlight-lang-io mw-content-ltr" dir="ltr"><pre>List do ( selectionSortInPlace := method( size repeat(idx, swapIndices(idx, indexOf(slice(idx, size) min)) ) ) ) l := list(-1, 4, 2, -9) l selectionSortInPlace println # ==> list(-9, -1, 2, 4) </pre></div> <h2><a href="/wiki/Category:J" title="Category:J">J</a> </h2> <div class="messagebox" style="text-align:center">Generally, this task should be accomplished in J using <code>/:~</code>. Here we take an approach that's more comparable with the other examples on this page.</div> Create the following script and load it to a J session. <div class="mw-highlight mw-highlight-lang-j mw-content-ltr" dir="ltr"><pre>selectionSort=: verb define data=. y for_xyz. y do. temp=. xyz_index }. data nvidx=. xyz_index + temp i. <./ temp data=. ((xyz_index, nvidx) { data) (nvidx, xyz_index) } data end. data ) </pre></div> In an email discussion, Roger_Hui presented the following tacit code: <div class="mw-highlight mw-highlight-lang-j mw-content-ltr" dir="ltr"><pre>ix=: C.~ <@~.@(0, (i. <./)) ss1=: ({. , $:@}.)@ix^:(*@#) </pre></div> To validate: <div class="mw-highlight mw-highlight-lang-j mw-content-ltr" dir="ltr"><pre> [data=. 6 15 19 12 14 19 0 17 0 14 6 15 19 12 14 19 0 17 0 14 selectionSort data 0 0 6 12 14 14 15 17 19 19 ss1 data 0 0 6 12 14 14 15 17 19 19 </pre></div> <h2><a href="/wiki/Category:Java" title="Category:Java">Java</a> </h2> This algorithm sorts in place. The call <tt>sort(array)</tt> will rearrange the array and not create a new one. <div class="mw-highlight mw-highlight-lang-java mw-content-ltr" dir="ltr"><pre>public static void sort(int[] nums){ for(int currentPlace = 0;currentPlace<nums.length-1;currentPlace++){ int smallest = Integer.MAX_VALUE; int smallestAt = currentPlace+1; for(int check = currentPlace; check<nums.length;check++){ if(nums[check]<smallest){ smallestAt = check; smallest = nums[check]; } } int temp = nums[currentPlace]; nums[currentPlace] = nums[smallestAt]; nums[smallestAt] = temp; } } </pre></div> <h2><a href="/wiki/Category:JavaScript" title="Category:JavaScript">JavaScript</a> </h2> This algorithm sorts array of numbers. <div class="mw-highlight mw-highlight-lang-javascript mw-content-ltr" dir="ltr"><pre>function selectionSort(nums) { var len = nums.length; for(var i = 0; i < len; i++) { var minAt = i; for(var j = i + 1; j < len; j++) { if(nums[j] < nums[minAt]) minAt = j; } if(minAt != i) { var temp = nums[i]; nums[i] = nums[minAt]; nums[minAt] = temp; } } return nums; } </pre></div> <h2><a href="/wiki/Category:Jq" title="Category:Jq">jq</a> </h2> The following implementation does not impose any restrictions on the types of entities that may appear in the array to be sorted. That is, the array may include any collection of JSON entities. The definition also illustrates the use of an inner function (swap), and the use of jq's reduction operator, <tt>reduce</tt>.<div class="mw-highlight mw-content-ltr" dir="ltr"><pre># Sort any array def selection_sort: def swap(i;j): if i == j then . else .[i] as $tmp | .[i] = .[j] | .[j] = $tmp end; length as $length | reduce range(0; $length) as $currentPlace # state: $array ( .; . as $array | (reduce range( $currentPlace; $length) as $check # state: [ smallestAt, smallest] except initially [null] ( [$currentPlace+1] ; if length == 1 or $array[$check] < .[1] then [$check, $array[$check] ] else . end )) as $ans | swap( $currentPlace; $ans[0] ) ) ;</pre></div>Example:<div class="mw-highlight mw-content-ltr" dir="ltr"><pre>[1, 3.3, null, 2, null, [1,{"a":1 }] ] | selection_sort</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>[ null, null, 1, 2, 3.3, [ 1, { "a": 1 } ] ] </pre> <h2><a href="/wiki/Category:Julia" title="Category:Julia">Julia</a> </h2> <div class="examplemeta workswith">Works with: <a href="/wiki/Julia" class="mw-redirect" title="Julia">Julia</a> version 0.6</div> <div class="mw-highlight mw-highlight-lang-julia mw-content-ltr" dir="ltr"><pre>function selectionsort!(arr::Vector{<:Real}) len = length(arr) if len < 2 return arr end for i in 1:len-1 lmin, j = findmin(arr[i+1:end]) if lmin < arr[i] arr[i+j] = arr[i] arr[i] = lmin end end return arr end v = rand(-10:10, 10) println("# unordered: $v\n -> ordered: ", selectionsort!(v)) </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre># unordered: [2, -10, 0, -10, -9, -3, -3, 7, 8, -3] -> ordered: [-10, -10, -9, -3, -3, -3, 0, 2, 7, 8]</pre> <h2><a href="/wiki/Category:Kotlin" title="Category:Kotlin">Kotlin</a> </h2> <div class="examplemeta translation">Translation of: <a href="#C#">C#</a></div> <div class="mw-highlight mw-highlight-lang-scala mw-content-ltr" dir="ltr"><pre>fun <T : Comparable<T>> Array<T>.selection_sort() { for (i in 0..size - 2) { var k = i for (j in i + 1..size - 1) if (this[j] < this[k]) k = j if (k != i) { val tmp = this[i] this[i] = this[k] this[k] = tmp } } } fun main(args: Array<String>) { val i = arrayOf(4, 9, 3, -2, 0, 7, -5, 1, 6, 8) i.selection_sort() println(i.joinToString()) val s = Array(i.size, { -i[it].toShort() }) s.selection_sort() println(s.joinToString()) val c = arrayOf('z', 'h', 'd', 'c', 'a') c.selection_sort() println(c.joinToString()) } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>-5, -2, 0, 1, 3, 4, 6, 7, 8, 9 -9, -8, -7, -6, -4, -3, -1, 0, 2, 5 a, c, d, h, z</pre> <h2><a href="/wiki/Category:Liberty_BASIC" title="Category:Liberty BASIC">Liberty BASIC</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre> itemCount = 20 dim A(itemCount) for i = 1 to itemCount A(i) = int(rnd(1) * 100) next i print "Before Sort" gosub [printArray] '--- Selection sort algorithm for i = 1 to itemCount-1 jMin = i for j = i+1 to itemCount if A(j) < A(jMin) then jMin = j next tmp = A(i) A(i) = A(jMin) A(jMin) = tmp next '--- end of (Selection sort algorithm) print "After Sort" gosub [printArray] end [printArray] for i = 1 to itemCount print using("###", A(i)); next i print return</pre></div> <h2><a href="/wiki/Category:LSE" title="Category:LSE">LSE</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>(* ** Tri par Sélection ** (LSE2000) *) PROCEDURE &Test(TABLEAU DE ENTIER pDonnees[], ENTIER pTaille) LOCAL pTaille ENTIER i, j, minimum, tmp POUR i <- 0 JUSQUA pTaille-1 FAIRE minimum <- i POUR j <- i+1 JUSQUA pTaille FAIRE SI pDonnees[j] < pDonnees[minimum] ALORS minimum <- j FIN SI BOUCLER SI i # min ALORS tmp <- pDonnees[i] pDonnees[i] <- pDonnees[minimum] pDonnees[minimum] <- tmp FIN SI BOUCLER FIN PROCEDURE</pre></div> <h2><a href="/wiki/Category:Lua" title="Category:Lua">Lua</a> </h2> <div class="mw-highlight mw-highlight-lang-lua mw-content-ltr" dir="ltr"><pre>function SelectionSort( f ) for k = 1, #f-1 do local idx = k for i = k+1, #f do if f[i] < f[idx] then idx = i end end f[k], f[idx] = f[idx], f[k] end end f = { 15, -3, 0, -1, 5, 4, 5, 20, -8 } SelectionSort( f ) for i in next, f do print( f[i] ) end </pre></div> <h2><a href="/wiki/Category:Maple" title="Category:Maple">Maple</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>arr:= Array([17,3,72,0,36,2,3,8,40,0]): len := numelems(arr): for i to len-1 do j_min := i: for j from i+1 to len do if arr[j] < arr[j_min] then j_min := j: end if: end do: if (not j_min = i) then temp := arr[i]: arr[i] := arr[j_min]: arr[j_min] := temp: end if: end do: arr;</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>[0,0,2,3,3,8,17,36,40,72]</pre> <h2><a href="/wiki/Category:Mathematica" title="Category:Mathematica">Mathematica</a> /<a href="/wiki/Category:Wolfram_Language" class="mw-redirect" title="Category:Wolfram Language">Wolfram Language</a> </h2> Procedural solution with custom min function: <div class="mw-highlight mw-highlight-lang-mathematica mw-content-ltr" dir="ltr"><pre>SelectSort[x_List] := Module[{n = 1, temp, xi = x, j}, While[n <= Length@x, temp = xi[[n]]; For[j = n, j <= Length@x, j++, If[xi[[j]] < temp, temp = xi[[j]]]; ]; xi[[n ;;]] = {temp}~Join~ Delete[xi[[n ;;]], First@Position[xi[[n ;;]], temp] ]; n++; ]; xi ] </pre></div> Recursive solution using a pre-existing Min[] function: <div class="mw-highlight mw-highlight-lang-mathematica mw-content-ltr" dir="ltr"><pre>SelectSort2[x_List]:= Flatten[{Min@x, If[Length@x > 1, SelectSort2@Drop[x, First@Position[x, Min@x]], {}] }]; </pre></div> Validate by testing the ordering of a random number of randomly-sized random lists: <div class="mw-highlight mw-highlight-lang-mathematica mw-content-ltr" dir="ltr"><pre>{And @@ Table[l = RandomInteger[150, RandomInteger[1000]]; Through[And[Length@# == Length@SelectSort@# &, OrderedQ@SelectSort@# &]@l], {RandomInteger[150]}], Block[{$RecursionLimit = Infinity}, And @@ Table[l = RandomInteger[150, RandomInteger[1000]]; Through[And[Length@# == Length@SelectSort2@# &, OrderedQ@SelectSort2@# &]@l], {RandomInteger[150]}] ]} </pre></div> Validation Result: <pre>{True, True}</pre> <h2><a href="/wiki/Category:MATLAB" title="Category:MATLAB">MATLAB</a> / <a href="/wiki/Category:Octave" title="Category:Octave">Octave</a> </h2> <div class="mw-highlight mw-highlight-lang-matlab mw-content-ltr" dir="ltr"><pre>function list = selectionSort(list) listSize = numel(list); for i = (1:listSize-1) minElem = list(i); minIndex = i; %This for loop can be vectorized, but there will be no significant %increase in sorting efficiency. for j = (i:listSize) if list(j) <= minElem minElem = list(j); minIndex = j; end end if i ~= minIndex list([minIndex i]) = list([i minIndex]); %Swap end end %for end %selectionSort </pre></div> Sample Usage: <div class="mw-highlight mw-highlight-lang-matlab mw-content-ltr" dir="ltr"><pre>>> selectionSort([4 3 1 5 6 2]) ans = 1 2 3 4 5 6 </pre></div> <h2><a href="/wiki/Category:Maxima" title="Category:Maxima">Maxima</a> </h2> <div class="mw-highlight mw-highlight-lang-maxima mw-content-ltr" dir="ltr"><pre>selection_sort(v) := block([k, m, n], n: length(v), for i: 1 thru n do ( k: i, m: v[i], for j: i + 1 thru n do if v[j] < m then (k: j, m: v[j]), v[k]: v[i], v[i]: m ))$ v: makelist(random(199) - 99, i, 1, 10); /* [52, -85, 41, -70, -59, 88, 19, 80, 90, 44] */ selection_sort(v)$ v; /* [-85, -70, -59, 19, 41, 44, 52, 80, 88, 90] */ </pre></div> <h2><a href="/wiki/Category:MAXScript" title="Category:MAXScript">MAXScript</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>fn selectionSort arr = ( local min = undefined for i in 1 to arr.count do ( min = i for j in i+1 to arr.count do ( if arr[j] < arr[min] then ( min = j ) ) swap arr[i] arr[min] ) arr ) data = selectionSort #(4, 9, 3, -2, 0, 7, -5, 1, 6, 8) print data</pre></div> <h2><a href="/wiki/Category:N/t/roff" title="Category:N/t/roff">N/t/roff</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>.de end .. .de array . nr \\$1.c 0 1 . de \\$1.push end . nr \\$1..\\\\n+[\\$1.c] \\\\$1 . end . de \\$1.pushln end . if \\\\n(.$>0 .\\$1.push \\\\$1 . if \\\\n(.$>1 \{ \ . shift . \\$1.pushln \\\\$@ . \} . end . de \\$1.dump end . nr i 0 1 . while \\\\n+i<=\\\\n[\\$1.c] .tm \\\\n[\\$1..\\\\ni] . rr i . end . de \\$1.swap end . if (\\\\$1<=\\\\n[\\$1.c])&(\\\\$2<=\\\\n[\\$1.c]) \{ \ . nr b \\\\n[\\$1..\\\\$1] . nr \\$1..\\\\$1 \\\\n[\\$1..\\\\$2] . nr \\$1..\\\\$2 \\\\nb . rr b . \} . end .. .array myArray .myArray.pushln 14 62 483 21 12 11 0 589 212 10 5 4 95 4 2 2 12 0 0 .de sort . nr i 0 1 . while \\n+i<=\\n[\\$1.c] \{ \ . nr j \\ni 1 . nr st \\nj . while \\n+j<=\\n[\\$1.c] \{ \ . if \\n[\\$1..\\nj]<\\n[\\$1..\\n(st] .nr st \\nj . \} . if !\\n(st=\\ni .\\$1.swap \\ni \\n(st . \} .. .sort myArray .myArray.dump</pre></div> <h3>Output</h3> <div class="mw-highlight mw-highlight-lang-text mw-content-ltr" dir="ltr"><pre>0 0 0 2 2 4 4 5 10 11 12 12 14 21 62 95 212 483 589 </pre></div> <h2><a href="/wiki/Category:Nanoquery" title="Category:Nanoquery">Nanoquery</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Java">Java</a></div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>import math def sort(nums) global math for currentPlace in range(0, len(nums) - 2) smallest = math.maxint smallestAt = currentPlace + 1 for check in range(currentPlace, len(nums) - 1) if nums[check] < smallest smallestAt = check smallest = nums[check] end end temp = nums[currentPlace] nums[currentPlace] = nums[smallestAt] nums[smallestAt] = temp end return nums end</pre></div> <h2><a href="/wiki/Category:Nemerle" title="Category:Nemerle">Nemerle</a> </h2> <div class="examplemeta translation">Translation of: <a href="#C#">C#</a></div> <div class="mw-highlight mw-highlight-lang-nemerle mw-content-ltr" dir="ltr"><pre>using System; using System.Console; module Selection { public static Sort[T](this a : array[T]) : void where T : IComparable { mutable k = 0; def lastindex = a.Length - 1; foreach (i in [0 .. lastindex]) { k = i; foreach (j in [i .. lastindex]) when (a[j].CompareTo(a[k]) < 0) k = j; a[i] <-> a[k]; } } Main() : void { def arr = array[6, 2, 8, 3, 9, 4, 7, 3, 9, 1]; arr.Sort(); foreach (i in arr) Write($"$i "); } } </pre></div> <h2><a href="/wiki/Category:NetRexx" title="Category:NetRexx">NetRexx</a> </h2> <div class="mw-highlight mw-highlight-lang-rexx mw-content-ltr" dir="ltr"><pre>/* NetRexx */ options replace format comments java crossref savelog symbols binary import java.util.List placesList = [String - "UK London", "US New York", "US Boston", "US Washington" - , "UK Washington", "US Birmingham", "UK Birmingham", "UK Boston" - ] lists = [ - placesList - , selectionSort(String[] Arrays.copyOf(placesList, placesList.length)) - ] loop ln = 0 to lists.length - 1 cl = lists[ln] loop ct = 0 to cl.length - 1 say cl[ct] end ct say end ln return method selectionSort(a = String[]) public constant binary returns String[] rl = String[a.length] al = List selectionSort(Arrays.asList(a)) al.toArray(rl) return rl method selectionSort(a = List) public constant binary returns ArrayList ra = ArrayList(a) n = ra.size iPos = int iMin = int loop iPos = 0 to n - 1 iMin = iPos loop i_ = iPos + 1 to n - 1 if (Comparable ra.get(i_)).compareTo(Comparable ra.get(iMin)) < 0 then do iMin = i_ end end i_ if iMin \= iPos then do swap = ra.get(iPos) ra.set(iPos, ra.get(iMin)) ra.set(iMin, swap) end end iPos return ra </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>UK London US New York US Boston US Washington UK Washington US Birmingham UK Birmingham UK Boston UK Birmingham UK Boston UK London UK Washington US Birmingham US Boston US New York US Washington </pre> <h2><a href="/wiki/Category:Nim" title="Category:Nim">Nim</a> </h2> <div class="mw-highlight mw-highlight-lang-nim mw-content-ltr" dir="ltr"><pre>proc selectionSort[T](a: var openarray[T]) = let n = a.len for i in 0 ..< n: var m = i for j in i ..< n: if a[j] < a[m]: m = j swap a[i], a[m] var a = @[4, 65, 2, -31, 0, 99, 2, 83, 782] selectionSort a echo a </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>@[-31, 0, 2, 2, 4, 65, 83, 99, 782]</pre> <h2><a href="/wiki/Category:OCaml" title="Category:OCaml">OCaml</a> </h2> <div class="mw-highlight mw-highlight-lang-ocaml mw-content-ltr" dir="ltr"><pre>let rec selection_sort = function [] -> [] | first::lst -> let rec select_r small output = function [] -> small :: selection_sort output | x::xs when x < small -> select_r x (small::output) xs | x::xs -> select_r small (x::output) xs in select_r first [] lst </pre></div> <h2><a href="/wiki/Category:Oforth" title="Category:Oforth">Oforth</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>: selectSort(l) | b j i k s | l size ->s l asListBuffer ->b s loop: i [ i dup ->k b at i 1 + s for: j [ b at(j) 2dup <= ifTrue: [ drop ] else: [ nip j ->k ] ] k i b at b put i swap b put ] b dup freeze ;</pre></div> <h2><a href="/wiki/Category:OoRexx" title="Category:OoRexx">ooRexx</a> </h2> <div class="mw-highlight mw-highlight-lang-rexx mw-content-ltr" dir="ltr"><pre>/*REXX **************************************************************** * program sorts an array using the selection-sort method. * derived from REXX solution * Note that ooRexx can process Elements of the stem argument (Use Arg) * 06.10.2010 Walter Pachl **********************************************************************/ call generate /*generate the array elements. */ call show 'before sort' /*show the before array elements,*/ call selectionSort x. /*invoke the selection sort. */ call show 'after sort' /*show the after array elements.*/ exit /*stick a fork in it, we're done.*/ selectionSort: Procedure Use Arg s. /* gain access to the argument */ do j=1 To s.0-1 t=s.j; p=j; do k=j+1 to s.0 if s.k<t then do; t=s.k; p=k; end end if p=j then iterate t=s.j; s.j=s.p; s.p=t end return show: Parse Arg heading Say heading Do i=1 To x.0 Say i' 'x.i End say copies('-',79) Return return generate: x.1='---The seven hills of Rome:---' x.2='==============================' x.3='Caelian' x.4='Palatine' x.5='Capitoline' x.6='Virminal' x.7='Esquiline' x.8='Quirinal' x.9='Aventine' x.0=9 return </pre></div> <h2><a href="/wiki/Category:Oz" title="Category:Oz">Oz</a> </h2> Although lists are much more used in Oz than arrays, this algorithm seems more natural for arrays. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>declare proc {SelectionSort Arr} proc {Swap K L} Arr.K := (Arr.L := Arr.K) end Low = {Array.low Arr} High = {Array.high Arr} in  %% for every index I of the array for I in Low..High do %% find the index of the minimum element %% with an index >= I Min = {NewCell Arr.I} MinIndex = {NewCell I} in for J in I..High do if Arr.J < @Min then Min := Arr.J MinIndex := J end end %% and put that minimum element to the left {Swap @MinIndex I} end end A = {Tuple.toArray unit(3 1 4 1 5 9 2 6 5)} in {SelectionSort A} {Show {Array.toRecord unit A}}</pre></div> <h2><a href="/wiki/Category:PARI/GP" title="Category:PARI/GP">PARI/GP</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>selectionSort(v)={ for(i=1,#v-1, my(mn=i,t); for(j=i+1,#v, if(v[j]<v[mn],mn=j) ); t=v[mn]; v[mn]=v[i]; v[i]=t ); v };</pre></div> <h2><a href="/wiki/Category:Pascal" title="Category:Pascal">Pascal</a> </h2> See <a class="mw-selflink-fragment" href="#Delphi"> Delphi</a> <h2><a href="/wiki/Category:Perl" title="Category:Perl">Perl</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Tcl">Tcl</a></div> <div class="mw-highlight mw-highlight-lang-perl mw-content-ltr" dir="ltr"><pre>sub selection_sort {my @a = @_; foreach my $i (0 .. $#a - 1) {my $min = $i + 1; $a[$_] < $a[$min] and $min = $_ foreach $min .. $#a; $a[$i] > $a[$min] and @a[$i, $min] = @a[$min, $i];} return @a;} </pre></div> <h2><a href="/wiki/Category:Phix" title="Category:Phix">Phix</a> </h2> <pre>with javascript_semantics function selection_sort(sequence s) for i=1 to length(s) do integer m = i object si = s[i], sm = s[m] for j=i+1 to length(s) do object sj = s[j] if sj<sm then {sm,m} = {sj,j} end if end for if sm<si then -- (or equivalently m!=i) s[i] = sm s[m] = si end if end for return s end function ?selection_sort(shuffle(tagset(10))) </pre> <div> <dl><dt>Output:</dt></dl></div> <pre>{1,2,3,4,5,6,7,8,9,10} </pre> <h2><a href="/wiki/Category:PHP" title="Category:PHP">PHP</a> </h2> Iterative: <div class="mw-highlight mw-highlight-lang-php mw-content-ltr" dir="ltr"><pre>function selection_sort(&$arr) { $n = count($arr); for($i = 0; $i < count($arr); $i++) { $min = $i; for($j = $i + 1; $j < $n; $j++){ if($arr[$j] < $arr[$min]){ $min = $j; } } list($arr[$i],$arr[$min]) = array($arr[$min],$arr[$i]); } } </pre></div> Recursive: <div class="mw-highlight mw-highlight-lang-php mw-content-ltr" dir="ltr"><pre>function selectionsort($arr,$result=array()){ if(count($arr) == 0){ return $result; } $nresult = $result; $nresult[] = min($arr); unset($arr[array_search(min($arr),$arr)]); return selectionsort($arr,$nresult); } </pre></div> <h2><a href="/wiki/Category:PicoLisp" title="Category:PicoLisp">PicoLisp</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>(de selectionSort (Lst) (map '((L) (and (cdr L) (xchg L (member (apply min @) L)))) Lst ) Lst )</pre></div> <h2><a href="/wiki/Category:PL/I" title="Category:PL/I">PL/I</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>Selection: procedure options (main); /* 2 November 2013 */ declare a(10) fixed binary initial ( 5, 7, 3, 98, 4, -3, 25, 20, 60, 17); put edit (trim(a)) (a, x(1)); call Selection_Sort (a); put skip edit (trim(a)) (a, x(1)); Selection_sort: procedure (a); declare a(*) fixed binary; declare t fixed binary; declare n fixed binary; declare (i, j, k) fixed binary; n = hbound(a,1); do j = 1 to n; k = j; t = a(j); do i = j+1 to n; if t > a(i) then do; t = a(i); k = i; end; end; a(k) = a(j); a(j) = t; end; end Selection_Sort; end Selection;</pre></div> Results: <pre>5 7 3 98 4 -3 25 20 60 17 -3 3 4 5 7 17 20 25 60 98 </pre> <h2><a href="/wiki/Category:PowerShell" title="Category:PowerShell">PowerShell</a> </h2> <div class="mw-highlight mw-highlight-lang-powershell mw-content-ltr" dir="ltr"><pre>Function SelectionSort( [Array] $data ) { $datal=$data.length-1 0..( $datal - 1 ) | ForEach-Object { $min = $data[ $_ ] $mini = $_ ( $_ + 1 )..$datal | ForEach-Object { if( $data[ $_ ] -lt $min ) { $min = $data[ $_ ] $mini = $_ } } $temp = $data[ $_ ] $data[ $_ ] = $min $data[ $mini ] = $temp } $data } $l = 100; SelectionSort( ( 1..$l | ForEach-Object { $Rand = New-Object Random }{ $Rand.Next( 0, $l - 1 ) } ) ) </pre></div> <h2><a href="/wiki/Category:Prolog" title="Category:Prolog">Prolog</a> </h2> Works with SWI-Prolog 6.3.11 (needs nth0/4). <div class="mw-highlight mw-highlight-lang-prolog mw-content-ltr" dir="ltr"><pre>selection_sort([], []). selection_sort([H | L], [H1 | L2]) :- exchange(H, L, H1, L1), selection_sort(L1, L2). exchange(H, [], H, []). exchange(H, L, H1, L1) :- min_list(L, H2), ( H < H2 -> H1 = H, L1 = L ; H1 = H2, % does the exchange of the number H % and the min of the list nth0(Ind, L, H1, L2), nth0(Ind, L1, H, L2)). </pre></div> <h2><a href="/wiki/Category:PureBasic" title="Category:PureBasic">PureBasic</a> </h2> <div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>Procedure selectionSort(Array a(1)) Protected i, j, lastIndex, minIndex lastIndex = ArraySize(a()) For i = 0 To lastIndex - 1 minIndex = i For j = i + 1 To lastIndex If a(minIndex) > a(j) minIndex = j EndIf Next Swap a(minIndex), a(i) Next EndProcedure </pre></div> <h2><a href="/wiki/Category:Python" title="Category:Python">Python</a> </h2> <div class="mw-highlight mw-highlight-lang-python mw-content-ltr" dir="ltr"><pre>def selection_sort(lst): for i, e in enumerate(lst): mn = min(range(i,len(lst)), key=lst.__getitem__) lst[i], lst[mn] = lst[mn], e return lst </pre></div> <h2><a href="/wiki/Category:Qi" title="Category:Qi">Qi</a> </h2> <div class="examplemeta translation">Translation of: <a href="#sml">sml</a></div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>(define select-r Small [] Output -> [Small | (selection-sort Output)] Small [X|Xs] Output -> (select-r X Xs [Small|Output]) where (< X Small) Small [X|Xs] Output -> (select-r Small Xs [X|Output])) (define selection-sort [] -> [] [First|Lst] -> (select-r First Lst [])) (selection-sort [8 7 4 3 2 0 9 1 5 6])</pre></div> <h2><a href="/wiki/Category:Quackery" title="Category:Quackery">Quackery</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre> [ 0 swap behead swap witheach [ 2dup > iff [ nip nip i^ 1+ swap ] else drop ] drop ] is least ( [ --> n ) [ [] swap dup size times [ dup least pluck swap dip join ] drop ] is ssort ( [ --> [ ) [] 20 times [ 10 random join ] dup echo cr ssort echo cr</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>[ 5 2 5 0 4 5 1 5 1 1 0 3 7 2 0 9 6 1 8 7 ] [ 0 0 0 1 1 1 1 2 2 3 4 5 5 5 5 6 7 7 8 9 ] </pre> <h2><a href="/wiki/Category:R" title="Category:R">R</a> </h2> For loop: <div class="mw-highlight mw-highlight-lang-r mw-content-ltr" dir="ltr"><pre>selectionsort.loop <- function(x) { lenx <- length(x) for(i in seq_along(x)) { mini <- (i - 1) + which.min(x[i:lenx]) start_ <- seq_len(i-1) x <- c(x[start_], x[mini], x[-c(start_, mini)]) } x } </pre></div> Recursive: (A prettier solution, but, you may need to increase the value of options("expressions") to test it. Also, you may get a stack overflow if the length of the input vector is more than a few thousand.) <div class="mw-highlight mw-highlight-lang-r mw-content-ltr" dir="ltr"><pre>selectionsort.rec <- function(x) { if(length(x) > 1) { mini <- which.min(x) c(x[mini], selectionsort(x[-mini])) } else x } </pre></div> <h2><a href="/wiki/Category:Ra" title="Category:Ra">Ra</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>class SelectionSort **Sort a list with the Selection Sort algorithm** on start args := program arguments .sort(args) print args define sort(list) is shared **Sort the list** test list := [4, 2, 7, 3] .sort(list) assert list = [2, 3, 4, 7] body count := list.count last := count - 1 for i in last minCandidate := i j := i + 1 while j < count if list[j] < list[minCandidate], minCandidate := j j :+ 1 temp := list[i] list[i] := list[minCandidate] list[minCandidate] := temp</pre></div> <h2><a href="/wiki/Category:Racket" title="Category:Racket">Racket</a> </h2> <div class="mw-highlight mw-highlight-lang-racket mw-content-ltr" dir="ltr"><pre>#lang racket (define (selection-sort xs) (cond [(empty? xs) '()] [else (define x0 (apply min xs)) (cons x0 (selection-sort (remove x0 xs)))])) </pre></div> <h2><a href="/wiki/Category:Raku" title="Category:Raku">Raku</a> </h2> (formerly Perl 6) Solution 1: <div class="mw-highlight mw-highlight-lang-raku mw-content-ltr mw-highlight-lines" dir="ltr"><pre>sub selection_sort ( @a is copy ) { for 0 ..^ @a.end -> $i { my $min = [ $i+1 .. @a.end ].min: { @a[$_] }; @a[$i, $min] = @a[$min, $i] if @a[$i] > @a[$min]; } return @a; } my @data = 22, 7, 2, -5, 8, 4; say 'input = ' ~ @data; say 'output = ' ~ @data.&selection_sort; </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>input = 22 7 2 -5 8 4 output = -5 2 4 7 8 22 </pre> Solution 2: <div class="mw-highlight mw-highlight-lang-raku mw-content-ltr mw-highlight-lines" dir="ltr"><pre>sub selectionSort(@tmp) { for ^@tmp -> $i { my $min = $i; @tmp[$i, $_] = @tmp[$_, $i] if @tmp[$min] > @tmp[$_] for $i^..^@tmp; } return @tmp; } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>input = 22 7 2 -5 8 4 output = -5 2 4 7 8 22 </pre> <h2><a href="/wiki/Category:REXX" title="Category:REXX">REXX</a> </h2> <div class="mw-highlight mw-highlight-lang-rexx mw-content-ltr" dir="ltr"><pre>/*REXX program sorts a stemmed array using the selection─sort algorithm. */ call init /*assign some values to an array: @. */ call show 'before sort' /*show the before array elements. */ say copies('▒', 65) /*show a nice separator line (fence). */ call selectionSort # /*invoke selection sort (and # items). */ call show ' after sort' /*show the after array elements. */ exit 0 /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ init: @.=; @.1 = '---The seven hills of Rome:---' @.2 = '=============================='; @.6 = 'Virminal' @.3 = 'Caelian' ; @.7 = 'Esquiline' @.4 = 'Palatine' ; @.8 = 'Quirinal' @.5 = 'Capitoline' ; @.9 = 'Aventine' do #=1 until @.#==''; end /*find the number of items in the array*/ #= #-1; return /*adjust # (because of DO index). */ /*──────────────────────────────────────────────────────────────────────────────────────*/ selectionSort: procedure expose @.; parse arg n do j=1 for n-1; _= @.j; p= j do k=j+1 to n; if @.k>=_ then iterate _= @.k; p= k /*this item is out─of─order, swap later*/ end /*k*/ if p==j then iterate /*if the same, the order of items is OK*/ _= @.j; @.j= @.p; @.p= _ /*swap 2 items that're out─of─sequence.*/ end /*j*/ return /*──────────────────────────────────────────────────────────────────────────────────────*/ show: do i=1 for #; say ' element' right(i,length(#)) arg(1)":" @.i; end; return </pre></div> <div> <dl><dt>output:</dt></dl></div> <pre> element 1 before sort: ---The seven hills of Rome:--- element 2 before sort: ============================== element 3 before sort: Caelian element 4 before sort: Palatine element 5 before sort: Capitoline element 6 before sort: Virminal element 7 before sort: Esquiline element 8 before sort: Quirinal element 9 before sort: Aventine ▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒ element 1 after sort: ---The seven hills of Rome:--- element 2 after sort: ============================== element 3 after sort: Aventine element 4 after sort: Caelian element 5 after sort: Capitoline element 6 after sort: Esquiline element 7 after sort: Palatine element 8 after sort: Quirinal element 9 after sort: Virminal </pre> <h2><a href="/wiki/Category:Ring" title="Category:Ring">Ring</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>aList = [7,6,5,9,8,4,3,1,2,0] see sortList(aList) func sortList list count = len(list) + 1 last = count - 1 for i = 1 to last minCandidate = i j = i + 1 while j < count if list[j] < list[minCandidate] minCandidate = j ok j = j + 1 end temp = list[i] list[i] = list[minCandidate] list[minCandidate] = temp next return list</pre></div> <h2><a href="/wiki/Category:Ruby" title="Category:Ruby">Ruby</a> </h2> <div class="mw-highlight mw-highlight-lang-ruby mw-content-ltr" dir="ltr"><pre># a relatively readable version - creates a distinct array def sequential_sort(array) sorted = [] while array.any? index_of_smallest_element = find_smallest_index(array) # defined below sorted << array.delete_at(index_of_smallest_element) end sorted end def find_smallest_index(array) smallest_element = array[0] smallest_index = 0 array.each_with_index do |ele, idx| if ele < smallest_element smallest_element = ele smallest_index = idx end end smallest_index end puts "sequential_sort([9, 6, 8, 7, 5]): #{sequential_sort([9, 6, 8, 7, 5])}" # prints: sequential_sort([9, 6, 8, 7, 5]): [5, 6, 7, 8, 9] # more efficient version - swaps the array's elements in place def sequential_sort_with_swapping(array) array.each_with_index do |element, index| smallest_unsorted_element_so_far = element smallest_unsorted_index_so_far = index (index+1...array.length).each do |index_value| if array[index_value] < smallest_unsorted_element_so_far smallest_unsorted_element_so_far = array[index_value] smallest_unsorted_index_so_far = index_value end end # swap index_value-th smallest element for index_value-th element array[index], array[smallest_unsorted_index_so_far] = array[smallest_unsorted_index_so_far], array[index] end array end puts "sequential_sort_with_swapping([7,6,5,9,8,4,3,1,2,0]): #{sequential_sort_with_swapping([7,6,5,9,8,4,3,1,2,0])}" # prints: sequential_sort_with_swapping([7,6,5,9,8,4,3,1,2,0]): [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] </pre></div> <h2><a href="/wiki/Category:Run_BASIC" title="Category:Run BASIC">Run BASIC</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>siz = 10 dim srdData(siz) for i = 1 to siz srtData(i) = rnd(0) * 100 next i FOR i = 1 TO siz-1 lo = i FOR j = (i + 1) TO siz IF srtData(j) < srtData(lo) lo = j NEXT j if i <> lo then temp = srtData(i) srtData(i) = srtData(lo) srtData(lo) = temp end if NEXT i for i = 1 to siz print i;chr$(9);srtData(i) next i</pre></div> <pre>1 20.5576419 2 32.4299311 3 48.345375 4 54.135847 5 63.1427764 6 67.8079128 7 85.2134895 8 91.3576602 9 95.4280853 10 98.8323211</pre> <h2><a href="/wiki/Category:Rust" title="Category:Rust">Rust</a> </h2> <div class="mw-highlight mw-highlight-lang-rust mw-content-ltr" dir="ltr"><pre>fn selection_sort(array: &mut [i32]) { let mut min; for i in 0..array.len() { min = i; for j in (i+1)..array.len() { if array[j] < array[min] { min = j; } } let tmp = array[i]; array[i] = array[min]; array[min] = tmp; } } fn main() { let mut array = [ 9, 4, 8, 3, -5, 2, 1, 6 ]; println!("The initial array is {:?}", array); selection_sort(&mut array); println!(" The sorted array is {:?}", array); } </pre></div>Another way:<div class="mw-highlight mw-highlight-lang-rust mw-content-ltr" dir="ltr"><pre>fn selection_sort<T: std::cmp::PartialOrd>(arr: &mut [T]) { for i in 0 .. arr.len() { let unsorted = &mut arr[i..]; let mut unsorted_min: usize = 0; for (j, entry) in unsorted.iter().enumerate() { if *entry < unsorted[unsorted_min] { unsorted_min = j; } } unsorted.swap(0, unsorted_min); } } </pre></div> <h2><a href="/wiki/Category:Scala" title="Category:Scala">Scala</a> </h2> <div class="mw-highlight mw-highlight-lang-scala mw-content-ltr" dir="ltr"><pre>def swap(a: Array[Int], i1: Int, i2: Int) = { val tmp = a(i1); a(i1) = a(i2); a(i2) = tmp } def selectionSort(a: Array[Int]) = for (i <- 0 until a.size - 1) swap(a, i, (i + 1 until a.size).foldLeft(i)((currMin, index) => if (a(index) < a(currMin)) index else currMin)) </pre></div> This version avoids the extra definition by using a function literal: <div class="mw-highlight mw-highlight-lang-scala mw-content-ltr" dir="ltr"><pre>def selectionSort(a: Array[Int]) = for (i <- 0 until a.size - 1) ( { (i1: Int, i2: Int) => val tmp = a(i1); a(i1) = a(i2); a(i2) = tmp } ) (i, (i + 1 until a.size).foldLeft(i)((currMin, index) => if (a(index) < a(currMin)) index else currMin) ) </pre></div> Functional way: <div class="mw-highlight mw-highlight-lang-scala mw-content-ltr" dir="ltr"><pre>def selectionSort[T <% Ordered[T]](list: List[T]): List[T] = { def remove(e: T, list: List[T]): List[T] = list match { case Nil => Nil case x :: xs if x == e => xs case x :: xs => x :: remove(e, xs) } list match { case Nil => Nil case _ => val min = list.min min :: selectionSort(remove(min, list)) } } </pre></div> <h2><a href="/wiki/Category:Seed7" title="Category:Seed7">Seed7</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>const proc: selectionSort (inout array elemType: arr) is func local var integer: i is 0; var integer: j is 0; var integer: min is 0; var elemType: help is elemType.value; begin for i range 1 to length(arr) - 1 do min := i; for j range i + 1 to length(arr) do if arr[j] < arr[min] then min := j; end if; end for; help := arr[min]; arr[min] := arr[i]; arr[i] := help; end for; end func;</pre></div> Original source: <a rel="nofollow" class="external autonumber" href="http://seed7.sourceforge.net/algorith/sorting.htm#selectionSort">[1]</a> <h2><a href="/wiki/Category:Sidef" title="Category:Sidef">Sidef</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Ruby">Ruby</a></div> <div class="mw-highlight mw-highlight-lang-ruby mw-content-ltr" dir="ltr"><pre>class Array { method selectionsort { for i in ^(self.end) { var min_idx = i for j in (i+1 .. self.end) { if (self[j] < self[min_idx]) { min_idx = j } } self.swap(i, min_idx) } return self } } var nums = [7,6,5,9,8,4,3,1,2,0]; say nums.selectionsort; var strs = ["John", "Kate", "Zerg", "Alice", "Joe", "Jane"]; say strs.selectionsort; </pre></div> <h2><a href="/wiki/Category:Standard_ML" title="Category:Standard ML">Standard ML</a> </h2> <div class="mw-highlight mw-highlight-lang-sml mw-content-ltr" dir="ltr"><pre>fun selection_sort [] = [] | selection_sort (first::lst) = let val (small, output) = foldl (fn (x, (small, output)) => if x < small then (x, small::output) else (small, x::output) ) (first, []) lst in small :: selection_sort output end </pre></div> <h2><a href="/wiki/Category:Stata" title="Category:Stata">Stata</a> </h2> <div class="mw-highlight mw-highlight-lang-stata mw-content-ltr" dir="ltr"><pre>mata function selection_sort(real vector a) { real scalar i, j, k, n n = length(a) for (i = 1; i < n; i++) { k = i for (j = i+1; j <= n; j++) { if (a[j] < a[k]) k = j } if (k != i) a[(i, k)] = a[(k, i)] } } end </pre></div> <h2><a href="/wiki/Category:Swift" title="Category:Swift">Swift</a> </h2> <div class="mw-highlight mw-highlight-lang-swift mw-content-ltr" dir="ltr"><pre>func selectionSort(inout arr:[Int]) { var min:Int for n in 0..<arr.count { min = n for x in n+1..<arr.count { if (arr[x] < arr[min]) { min = x } } if min != n { let temp = arr[min] arr[min] = arr[n] arr[n] = temp } } } </pre></div> <h2><a href="/wiki/Category:Tcl" title="Category:Tcl">Tcl</a> </h2> <div class="examplemeta libheader">Library: <a href="/wiki/Category:Tcllib" title="Category:Tcllib">Tcllib</a> (Package: struct::list)</div> <div class="mw-highlight mw-highlight-lang-tcl mw-content-ltr" dir="ltr"><pre>package require Tcl 8.5 package require struct::list proc selectionsort {A} { set len [llength $A] for {set i 0} {$i < $len - 1} {incr i} { set min_idx [expr {$i + 1}] for {set j $min_idx} {$j < $len} {incr j} { if {[lindex $A $j] < [lindex $A $min_idx]} { set min_idx $j } } if {[lindex $A $i] > [lindex $A $min_idx]} { struct::list swap A $i $min_idx } } return $A } puts [selectionsort {8 6 4 2 1 3 5 7 9}] ;# => 1 2 3 4 5 6 7 8 9 </pre></div> <h2><a href="/wiki/Category:TI-83_BASIC" title="Category:TI-83 BASIC">TI-83 BASIC</a> </h2> Store input into L1 and prgmSORTSLCT will store the sorted output into L2. <pre>:L1→L2 :dim(L2)→I :For(A,1,I) :A→C :0→X :For(B,A,I) :If L2(B)<L2(C) :Then :B→C :1→X :End :End :If X=1 :Then :L2(C)→B :L2(A)→L2(C) :B→L2(A) :End :End :DelVar A :DelVar B :DelVar C :DelVar I :DelVar X :Return </pre> <h2><a href="/wiki/Category:UBasic/4tH" title="Category:UBasic/4tH">uBasic/4tH</a> </h2> <div class="mw-highlight mw-highlight-lang-text mw-content-ltr" dir="ltr"><pre>PRINT "Selection sort:" n = FUNC (_InitArray) PROC _ShowArray (n) PROC _Selectionsort (n) PROC _ShowArray (n) PRINT END _Selectionsort PARAM (1) ' Selection sort LOCAL (3) FOR b@ = 0 TO a@-1 c@ = b@ FOR d@ = b@ TO a@-1 IF @(d@) < @(c@) THEN c@ = d@ NEXT IF b@ # c@ THEN PROC _Swap (b@, c@) NEXT RETURN _Swap PARAM(2) ' Swap two array elements PUSH @(a@) @(a@) = @(b@) @(b@) = POP() RETURN _InitArray ' Init example array PUSH 4, 65, 2, -31, 0, 99, 2, 83, 782, 1 FOR i = 0 TO 9 @(i) = POP() NEXT RETURN (i) _ShowArray PARAM (1) ' Show array subroutine FOR i = 0 TO a@-1 PRINT @(i), NEXT PRINT RETURN </pre></div> <h2><a href="/wiki/Category:Ursala" title="Category:Ursala">Ursala</a> </h2> The selection_sort function is parameterized by a relational predicate p. There are no arrays in Ursala so it uses a list, and the selected item is deleted from the list and inserted into another on each iteration rather than swapped with a preceding item of the same list. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>#import std selection_sort "p" = @iNX ~&l->rx ^(gldif ==,~&r)^/~&l ^|C/"p"$- ~&</pre></div> This is already a bad way to code a sorting algorithm in this language, but with only a bit more work, we can get a bigger and slower version that more closely simulates the operations of repeatedly reordering an array. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>selection_sort "p" = ~&itB^?a\~&a ^|JahPfatPRC/~& ~=-~BrhPltPClhPrtPCTlrTQrS^D/"p"$- ~&</pre></div> Here is a test program sorting by the partial order relation on natural numbers. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>#import nat #cast %nL example = selection_sort(nleq) <294,263,240,473,596,392,621,348,220,815></pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre><220,240,263,294,348,392,473,596,621,815></pre> <h2><a href="/wiki/Category:VBA" title="Category:VBA">VBA</a> </h2> I shameless stole the swap function from the bubblesort VBscript implementation. <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>sub swap( byref a, byref b) dim tmp tmp = a a = b b = tmp end sub function selectionSort (a) for i = 0 to ubound(a) k = i for j=i+1 to ubound(a) if a(j) < a(i) then swap a(i), a(j) end if next next selectionSort = a end function</pre></div> <h2><a href="/wiki/Category:VBScript" title="Category:VBScript">VBScript</a> </h2> <div class="mw-highlight mw-highlight-lang-vbnet mw-content-ltr" dir="ltr"><pre>Function Selection_Sort(s) arr = Split(s,",") For i = 0 To UBound(arr) For j = i To UBound(arr) temp = arr(i) If arr(j) < arr(i) Then arr(i) = arr(j) arr(j) = temp End If Next Next Selection_Sort = (Join(arr,",")) End Function WScript.StdOut.Write "Pre-Sort" & vbTab & "Sorted" WScript.StdOut.WriteLine WScript.StdOut.Write "3,2,5,4,1" & vbTab & Selection_Sort("3,2,5,4,1") WScript.StdOut.WriteLine WScript.StdOut.Write "c,e,b,a,d" & vbTab & Selection_Sort("c,e,b,a,d") </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Pre-Sort Sorted 3,2,5,4,1 1,2,3,4,5 c,e,b,a,d a,b,c,d,e </pre> <h2><a href="/wiki/Category:Wren" title="Category:Wren">Wren</a> </h2> <div class="examplemeta translation">Translation of: <a href="#Go">Go</a></div> <div class="mw-highlight mw-highlight-lang-wren mw-content-ltr" dir="ltr"><pre>var selectionSort = Fn.new { |a| var last = a.count - 1 for (i in 0...last) { var aMin = a[i] var iMin = i for (j in i+1..last) { if (a[j] < aMin) { aMin = a[j] iMin = j } } var t = a[i] a[i] = aMin a[iMin] = t } } var array = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ] for (a in array) { System.print("Before: %(a)") selectionSort.call(a) System.print("After : %(a)") System.print() } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>Before: [4, 65, 2, -31, 0, 99, 2, 83, 782, 1] After : [-31, 0, 1, 2, 2, 4, 65, 83, 99, 782] Before: [7, 5, 2, 6, 1, 4, 2, 6, 3] After : [1, 2, 2, 3, 4, 5, 6, 6, 7] </pre> Alternatively we can just call a library method. <div class="examplemeta libheader">Library: <a href="/wiki/Category:Wren-sort" title="Category:Wren-sort">Wren-sort</a></div> <div class="mw-highlight mw-highlight-lang-wren mw-content-ltr" dir="ltr"><pre>import "./sort" for Sort var array = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ] for (a in array) { System.print("Before: %(a)") Sort.selection(a) System.print("After : %(a)") System.print() } </pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>As above. </pre> <h2><a href="/wiki/Category:XPL0" title="Category:XPL0">XPL0</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>include c:\cxpl\codes; \intrinsic 'code' declarations string 0; \use zero-terminated strings proc SelSort(A, N); \Selection sort char A; \address of array int N; \number of elements in array (size) int I, J, S, JS, T; [for I:= 0 to N-2 do [S:= (~0)>>1; for J:= I to N-1 do \find smallest element if A(J) < S then [S:= A(J); JS:= J]; T:= A(I); A(I):= A(JS); A(JS):= T; ]; ]; func StrLen(Str); \Return number of characters in an ASCIIZ string char Str; int I; for I:= 0 to -1>>1-1 do if Str(I) = 0 then return I; char Str; [Str:= "Pack my box with five dozen liquor jugs."; SelSort(Str, StrLen(Str)); Text(0, Str); CrLf(0); ]</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre> .Pabcdeefghiiijklmnoooqrstuuvwxyz </pre> <h2><a href="/wiki/Category:Zkl" title="Category:Zkl">zkl</a> </h2> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>fcn selectionSort(list){ // sort a list of ints copy,r:=list.copy(),List(); while(copy){ min,idx:=(0).min(copy), copy.find(min); r.append(min); copy.del(idx); } r }</pre></div> <div class="mw-highlight mw-content-ltr" dir="ltr"><pre>selectionSort(List(28, 44, 46, 24, 19, -5, 2, 17, 11, 25, 4)).println();</pre></div> <div> <dl><dt>Output:</dt></dl></div> <pre>L(-5,2,4,11,17,19,24,25,28,44,46) </pre>    </div><noscript><img src="https://login.miraheze.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort?oldid=349291">https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort?oldid=349291</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Special:Categories" title="Special:Categories">Categories</a>: <ul><li><a href="/wiki/Category:Programming_Tasks" title="Category:Programming Tasks">Programming Tasks</a></li><li><a href="/wiki/Category:Sorting_Algorithms" title="Category:Sorting Algorithms">Sorting Algorithms</a></li><li><a href="/wiki/Category:Sorting" title="Category:Sorting">Sorting</a></li><li><a href="/wiki/Category:11l" title="Category:11l">11l</a></li><li><a href="/wiki/Category:360_Assembly" title="Category:360 Assembly">360 Assembly</a></li><li><a href="/wiki/Category:AArch64_Assembly" title="Category:AArch64 Assembly">AArch64 Assembly</a></li><li><a href="/wiki/Category:Action!" title="Category:Action!">Action!</a></li><li><a href="/wiki/Category:ActionScript" title="Category:ActionScript">ActionScript</a></li><li><a href="/wiki/Category:Ada" title="Category:Ada">Ada</a></li><li><a href="/wiki/Category:ALGOL_68" title="Category:ALGOL 68">ALGOL 68</a></li><li><a href="/wiki/Category:AppleScript" title="Category:AppleScript">AppleScript</a></li><li><a href="/wiki/Category:ARM_Assembly" title="Category:ARM Assembly">ARM Assembly</a></li><li><a href="/wiki/Category:Arturo" title="Category:Arturo">Arturo</a></li><li><a href="/wiki/Category:AutoHotkey" title="Category:AutoHotkey">AutoHotkey</a></li><li><a href="/wiki/Category:AWK" title="Category:AWK">AWK</a></li><li><a href="/wiki/Category:BBC_BASIC" title="Category:BBC BASIC">BBC BASIC</a></li><li><a href="/wiki/Category:BASIC" title="Category:BASIC">BASIC</a></li><li><a href="/wiki/Category:GWBASIC?action=edit&redlink=1" class="new" title="Category:GWBASIC (page does not exist)">GWBASIC</a></li><li><a href="/wiki/Category:IS-BASIC" title="Category:IS-BASIC">IS-BASIC</a></li><li><a href="/wiki/Category:BCPL" title="Category:BCPL">BCPL</a></li><li><a href="/wiki/Category:C" title="Category:C">C</a></li><li><a href="/wiki/Category:C_sharp" title="Category:C sharp">C sharp</a></li><li><a href="/wiki/Category:C%2B%2B" title="Category:C++">C++</a></li><li><a href="/wiki/Category:Clojure" title="Category:Clojure">Clojure</a></li><li><a href="/wiki/Category:COBOL" title="Category:COBOL">COBOL</a></li><li><a href="/wiki/Category:Common_Lisp" title="Category:Common Lisp">Common Lisp</a></li><li><a href="/wiki/Category:Crystal" title="Category:Crystal">Crystal</a></li><li><a href="/wiki/Category:D" title="Category:D">D</a></li><li><a href="/wiki/Category:Dart" title="Category:Dart">Dart</a></li><li><a href="/wiki/Category:Delphi" title="Category:Delphi">Delphi</a></li><li><a href="/wiki/Category:E" title="Category:E">E</a></li><li><a href="/wiki/Category:EasyLang" title="Category:EasyLang">EasyLang</a></li><li><a href="/wiki/Category:EchoLisp" title="Category:EchoLisp">EchoLisp</a></li><li><a href="/wiki/Category:Eiffel" title="Category:Eiffel">Eiffel</a></li><li><a href="/wiki/Category:Elena" title="Category:Elena">Elena</a></li><li><a href="/wiki/Category:Elixir" title="Category:Elixir">Elixir</a></li><li><a href="/wiki/Category:Erlang" title="Category:Erlang">Erlang</a></li><li><a href="/wiki/Category:Euphoria" title="Category:Euphoria">Euphoria</a></li><li><a href="/wiki/Category:F_Sharp" title="Category:F Sharp">F Sharp</a></li><li><a href="/wiki/Category:Factor" title="Category:Factor">Factor</a></li><li><a href="/wiki/Category:Forth" title="Category:Forth">Forth</a></li><li><a href="/wiki/Category:Fortran" title="Category:Fortran">Fortran</a></li><li><a href="/wiki/Category:FreeBASIC" title="Category:FreeBASIC">FreeBASIC</a></li><li><a href="/wiki/Category:Gambas" title="Category:Gambas">Gambas</a></li><li><a href="/wiki/Category:GAP" title="Category:GAP">GAP</a></li><li><a href="/wiki/Category:Go" title="Category:Go">Go</a></li><li><a href="/wiki/Category:Haskell" title="Category:Haskell">Haskell</a></li><li><a href="/wiki/Category:Haxe" title="Category:Haxe">Haxe</a></li><li><a href="/wiki/Category:Icon" title="Category:Icon">Icon</a></li><li><a href="/wiki/Category:Unicon" title="Category:Unicon">Unicon</a></li><li><a href="/wiki/Category:Io" title="Category:Io">Io</a></li><li><a href="/wiki/Category:J" title="Category:J">J</a></li><li><a href="/wiki/Category:Java" title="Category:Java">Java</a></li><li><a href="/wiki/Category:JavaScript" title="Category:JavaScript">JavaScript</a></li><li><a href="/wiki/Category:Jq" title="Category:Jq">Jq</a></li><li><a href="/wiki/Category:Julia" title="Category:Julia">Julia</a></li><li><a href="/wiki/Category:Kotlin" title="Category:Kotlin">Kotlin</a></li><li><a href="/wiki/Category:Liberty_BASIC" title="Category:Liberty BASIC">Liberty BASIC</a></li><li><a href="/wiki/Category:LSE" title="Category:LSE">LSE</a></li><li><a href="/wiki/Category:Lua" title="Category:Lua">Lua</a></li><li><a href="/wiki/Category:Maple" title="Category:Maple">Maple</a></li><li><a href="/wiki/Category:Mathematica" title="Category:Mathematica">Mathematica</a></li><li><a href="/wiki/Category:Wolfram_Language" class="mw-redirect" title="Category:Wolfram Language">Wolfram Language</a></li><li><a href="/wiki/Category:MATLAB" title="Category:MATLAB">MATLAB</a></li><li><a href="/wiki/Category:Octave" title="Category:Octave">Octave</a></li><li><a href="/wiki/Category:Maxima" title="Category:Maxima">Maxima</a></li><li><a href="/wiki/Category:MAXScript" title="Category:MAXScript">MAXScript</a></li><li><a href="/wiki/Category:N/t/roff" title="Category:N/t/roff">N/t/roff</a></li><li><a href="/wiki/Category:Nanoquery" title="Category:Nanoquery">Nanoquery</a></li><li><a href="/wiki/Category:Nemerle" title="Category:Nemerle">Nemerle</a></li><li><a href="/wiki/Category:NetRexx" title="Category:NetRexx">NetRexx</a></li><li><a href="/wiki/Category:Nim" title="Category:Nim">Nim</a></li><li><a href="/wiki/Category:OCaml" title="Category:OCaml">OCaml</a></li><li><a href="/wiki/Category:Oforth" title="Category:Oforth">Oforth</a></li><li><a href="/wiki/Category:OoRexx" title="Category:OoRexx">OoRexx</a></li><li><a href="/wiki/Category:Oz" title="Category:Oz">Oz</a></li><li><a href="/wiki/Category:PARI/GP" title="Category:PARI/GP">PARI/GP</a></li><li><a href="/wiki/Category:Pascal" title="Category:Pascal">Pascal</a></li><li><a href="/wiki/Category:Perl" title="Category:Perl">Perl</a></li><li><a href="/wiki/Category:Phix" title="Category:Phix">Phix</a></li><li><a href="/wiki/Category:PHP" title="Category:PHP">PHP</a></li><li><a href="/wiki/Category:PicoLisp" title="Category:PicoLisp">PicoLisp</a></li><li><a href="/wiki/Category:PL/I" title="Category:PL/I">PL/I</a></li><li><a href="/wiki/Category:PowerShell" title="Category:PowerShell">PowerShell</a></li><li><a href="/wiki/Category:Prolog" title="Category:Prolog">Prolog</a></li><li><a href="/wiki/Category:PureBasic" title="Category:PureBasic">PureBasic</a></li><li><a href="/wiki/Category:Python" title="Category:Python">Python</a></li><li><a href="/wiki/Category:Qi" title="Category:Qi">Qi</a></li><li><a href="/wiki/Category:Quackery" title="Category:Quackery">Quackery</a></li><li><a href="/wiki/Category:R" title="Category:R">R</a></li><li><a href="/wiki/Category:Ra" title="Category:Ra">Ra</a></li><li><a href="/wiki/Category:Racket" title="Category:Racket">Racket</a></li><li><a href="/wiki/Category:Raku" title="Category:Raku">Raku</a></li><li><a href="/wiki/Category:REXX" title="Category:REXX">REXX</a></li><li><a href="/wiki/Category:Ring" title="Category:Ring">Ring</a></li><li><a href="/wiki/Category:Ruby" title="Category:Ruby">Ruby</a></li><li><a href="/wiki/Category:Run_BASIC" title="Category:Run BASIC">Run BASIC</a></li><li><a href="/wiki/Category:Rust" title="Category:Rust">Rust</a></li><li><a href="/wiki/Category:Scala" title="Category:Scala">Scala</a></li><li><a href="/wiki/Category:Seed7" title="Category:Seed7">Seed7</a></li><li><a href="/wiki/Category:Sidef" title="Category:Sidef">Sidef</a></li><li><a href="/wiki/Category:Standard_ML" title="Category:Standard ML">Standard ML</a></li><li><a href="/wiki/Category:Stata" title="Category:Stata">Stata</a></li><li><a href="/wiki/Category:Swift" title="Category:Swift">Swift</a></li><li><a href="/wiki/Category:Tcl" title="Category:Tcl">Tcl</a></li><li><a href="/wiki/Category:Tcllib" title="Category:Tcllib">Tcllib</a></li><li><a href="/wiki/Category:TI-83_BASIC" title="Category:TI-83 BASIC">TI-83 BASIC</a></li><li><a href="/wiki/Category:UBasic/4tH" title="Category:UBasic/4tH">UBasic/4tH</a></li><li><a href="/wiki/Category:Ursala" title="Category:Ursala">Ursala</a></li><li><a href="/wiki/Category:VBA" title="Category:VBA">VBA</a></li><li><a href="/wiki/Category:VBScript" title="Category:VBScript">VBScript</a></li><li><a href="/wiki/Category:Wren" title="Category:Wren">Wren</a></li><li><a href="/wiki/Category:Wren-sort" title="Category:Wren-sort">Wren-sort</a></li><li><a href="/wiki/Category:XPL0" title="Category:XPL0">XPL0</a></li><li><a href="/wiki/Category:Zkl" title="Category:Zkl">Zkl</a></li><li><a href="/wiki/Category:GUISS/Omit" title="Category:GUISS/Omit">GUISS/Omit</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">Hidden category: <ul><li><a href="/wiki/Category:Pages_with_syntax_highlighting_errors" title="Category:Pages with syntax highlighting errors">Pages with syntax highlighting errors</a></li></ul></div></div> </div> </main> <div id='mw-data-after-content'> <div class="mw-cookiewarning-container"><div class="mw-cookiewarning-text">Cookies help us deliver our services. By using our services, you agree to our use of cookies.</div><form method="POST"><div class='oo-ui-layout oo-ui-horizontalLayout'><a role='button' tabindex='0' href='https://meta.miraheze.org/wiki/Special:MyLanguage/Privacy_Policy#2._Cookies' rel='nofollow' class='oo-ui-buttonElement-button'>More information</a><span class='oo-ui-widget oo-ui-widget-enabled oo-ui-inputWidget oo-ui-buttonElement oo-ui-buttonElement-framed oo-ui-labelElement oo-ui-flaggedElement-primary oo-ui-flaggedElement-progressive oo-ui-buttonInputWidget'><button type='submit' tabindex='0' name='disablecookiewarning' value='OK' class='oo-ui-inputWidget-input oo-ui-buttonElement-button'>OK</button></div></form></div> </div> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 25 November 2024, at 09:55.</li> <li id="footer-info-copyright">Content is available under GNU Free Document License 1.3 unless otherwise noted.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://meta.miraheze.org/wiki/Special:MyLanguage/Privacy_Policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Rosetta_Code:About">About Rosetta Code</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Rosetta_Code:General_disclaimer">Disclaimers</a></li> <li id="footer-places-termsofservice"><a href="https://meta.miraheze.org/wiki/Special:MyLanguage/Terms_of_Use">Terms of Use</a></li> <li id="footer-places-donate"><a href="https://meta.miraheze.org/wiki/Special:MyLanguage/Donate">Donate to Miraheze</a></li> <li id="footer-places-mobileview"><a href="https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort?mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-poweredbyico"><a href="https://meta.miraheze.org/wiki/Special:MyLanguage/Miraheze_Meta" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="https://static.wikitide.net/commonswiki/f/ff/Powered_by_Miraheze.svg" alt="Hosted by Miraheze" width="88" height="31" loading="lazy"></a><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/1.43/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a><a href="https://www.semantic-mediawiki.org/wiki/Semantic_MediaWiki" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/1.43/extensions/SemanticMediaWiki/res/smw/assets/logo_footer.svg" alt="Powered by Semantic MediaWiki" class="smw-footer" width="88" height="31" loading="lazy"></a></li> <li id="footer-copyrightico"><a href="https://www.gnu.org/licenses/fdl-1.3.en.html" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="https://www.gnu.org/graphics/gfdl-logo-tiny.png" alt="GNU Free Document License 1.3" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw182","wgBackendResponseTime":231,"wgPageParseReport":{"smw":{"limitreport-intext-parsertime":0.001},"limitreport":{"cputime":"0.938","walltime":"1.650","ppvisitednodes":{"value":4318,"limit":1000000},"postexpandincludesize":{"value":20674,"limit":2097152},"templateargumentsize":{"value":3914,"limit":2097152},"expansiondepth":{"value":6,"limit":100},"expensivefunctioncount":{"value":90,"limit":99},"unstrip-depth":{"value":0,"limit":20},"unstrip-size":{"value":428049,"limit":5000000},"timingprofile":["100.00% 788.503 1 -total"," 10.78% 85.010 110 Template:Header"," 1.46% 11.513 1 Template:Task"," 0.80% 6.322 1 Template:Tcllib"," 0.68% 5.361 11 Template:Trans"," 0.46% 3.619 37 Template:Out"," 0.44% 3.438 1 Template:Omit_from"," 0.42% 3.282 1 Template:Libheader"," 0.38% 3.033 7 Template:Works_with"," 0.30% 2.388 1 Template:Sorting_Algorithm"]},"cachereport":{"origin":"mw164","timestamp":"20241125095502","ttl":1296000,"transientcontent":false}}});});</script> <script> var _paq = window._paq = window._paq || []; if ( 1 ) { _paq.push(['disableCookies']); } if ( 0 ) { _paq.push(['setRequestMethod', 'GET']); } _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u = "https://analytics.wikitide.net/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setDocumentTitle', "rosettacodewiki" + " - " + "Sorting algorithms/Selection sort"]); _paq.push(['setSiteId', 6510]); _paq.push(['setCustomVariable', 1, 'userType', "Anonymous", "visit"]); if ( 1 ) { _paq.push(['addTracker', u + 'matomo.php', 1]); } var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script> <noscript><img src="https://analytics.wikitide.net/matomo.php?idsite=6510&rec=1&action_name=Sorting_algorithms/Selection_sort" style="border:0;" alt="" /></noscript> </body> </html>