# selection sort snippet in c

## selection sort

user5453

``````#include <bits/stdc++.h>

using namespace std;

void selectionSort(int arr[], int n){
int i,j,min;

for(i=0;i<n-1;i++){
min = i;
for(j=i+1;j<n;j++){
if(arr[j] < arr[min]){
min = j;
}
}
if(min != i){
swap(arr[i],arr[min]);
}
}
}

int main()
{
int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };
int n = sizeof(arr) / sizeof(arr[0]);

selectionSort(arr, n);

for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}

return 0;
}  ``````

## selection sort

user6188

``````def ssort(lst):
for i in range(len(lst)):
for j in range(i+1,len(lst)):
if lst[i]>lst[j]:lst[j],lst[i]=lst[i],lst[j]
return lst
if __name__=='__main__':
lst=[int(i) for i in input('Enter the Numbers: ').split()]
print(ssort(lst))``````

## selection sort

user4257

``````// C algorithm for SelectionSort

void selectionSort(int arr[], int n)
{
for(int i = 0; i < n-1; i++)
{
int min = i;

for(int j = i+1; j < n; j++)
{
if(arr[j] < arr[min])
min = j;
}

if(min != i)
{
// Swap
int temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}
}``````

## selection sort

user556

``````procedure selection sort
list  : array of items
n     : size of list

for i = 1 to n - 1
/* set current element as minimum*/
min = i

/* check the element to be minimum */

for j = i+1 to n
if list[j] < list[min] then
min = j;
end if
end for

/* swap the minimum element with the current element*/
if indexMin != i  then
swap list[min] and list[i]
end if
end for

end procedure``````

## selection sort

user335

``````// Por ter uma complexidade alta,
// Complexidade: O(n²) / O(n**2) / O(n^2)
// @see https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html

function selectionSort(vetor) {
let minor;
for (let i = 0; i < vetor.length - 1; i += 1) {
minor = i;
for (let j = i + 1; j < vetor.length; j += 1) {
if (vetor[j] < vetor[minor]) {
minor = j;
}
}
if (i !== minor) {
[vetor[i], vetor[minor]] = [vetor[minor], vetor[i]];
}
}
return vetor;
}

selectionSort([1, 2, 5, 8, 3, 4]);``````

## selection sort

user6012

``````# Python program for implementation of Selection
# Sort
import sys
A = [64, 25, 12, 22, 11]

# Traverse through all array elements
for i in range(len(A)):

# Find the minimum element in remaining
# unsorted array
min_idx = i
for j in range(i+1, len(A)):
if A[min_idx] > A[j]:
min_idx = j

# Swap the found minimum element with
# the first element
A[i], A[min_idx] = A[min_idx], A[i]

# Driver code to test above
print ("Sorted array")
for i in range(len(A)):
print("%d" %A[i]),
``````