# Selection Sort

Learn about selection sort, a straightforward algorithm for arranging data by repeatedly selecting the minimum element.

Sorting
easy

Published At

6/4/2021

Write a function that takes in an array of integers and returns a sorted version of that array. Use the Selection Sort algorithm to sort the array.

If you're unfamiliar with Selection Sort, we recommend watching the Conceptual Overview section of this question's video explanation before starting to code.

### Sample Input

js
``array = [8, 5, 2, 9, 5, 6, 3]``
js
``array = [8, 5, 2, 9, 5, 6, 3]``

### Sample Output

js
``[2, 3, 5, 5, 6, 8, 9]``
js
``[2, 3, 5, 5, 6, 8, 9]``

### Hints

Hint 1

Divide the input array into two subarrays in place. The first subarray should be sorted at all times and should start with a length of 0, while the second subarray should be unsorted. Find the smallest (or largest) element in the unsorted subarray and insert it into the sorted subarray with a swap. Repeat this process of finding the smallest (or largest) element in the unsorted subarray and inserting it in its correct position in the sorted subarray with a swap until the entire array is sorted.

Optimal Space & Time Complexity

Best: O(n^2) time | O(1) space - where n is the length of the input array Average: O(n^2) time | O(1) space - where n is the length of the input array Worst: O(n^2) time | O(1) space - where n is the length of the input array

Solution-1
js
``````function selectionSort(array) {
for (let i = 0; i < array.length; i++) {
let smallest = i;
for (let j = i; j < array.length; j ++) {
if (array[j] < array[smallest]) {
smallest = j;
}
}
let temp = array[i];
array[i] = array[smallest];
array[smallest] = temp;
}
return array
}``````
Solution-1
js
``````function selectionSort(array) {
for (let i = 0; i < array.length; i++) {
let smallest = i;
for (let j = i; j < array.length; j ++) {
if (array[j] < array[smallest]) {
smallest = j;
}
}
let temp = array[i];
array[i] = array[smallest];
array[smallest] = temp;
}
return array
}``````

🐾

Do you have any questions, or simply wish to contact me privately? Don't hesitate to shoot me a DM on Twitter.

Have a wonderful day.
Abhishek 🙏

## Join My Exclusive Newsletter Community

Step into a world where creativity intersects with technology. By subscribing, you'll get a front-row seat to my latest musings, full-stack development resources, and exclusive previews of future posts. Each email is a crafted experience that includes:

• In-depth looks at my covert projects and musings to ignite your imagination.
• Handpicked frontend development resources and current explorations, aimed at expanding your developer toolkit.
• A monthly infusion of inspiration with my personal selection of quotes, books, and music.

Embrace the confluence of words and wonder, curated thoughtfully and sent straight to your inbox.

No fluff. Just the highest caliber of ideas.