selection sort
// 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
// Easy-peasy
#include<iostream>
#include<algorithm>
using namespace std;
void selectionSort(vector<int> &arr) {
for(int i = 0; i < arr.size() - 1; ++i) {
for(int j = i + 1; j < arr.size(); ++j) {
if(arr[j] < arr[i]) swap(arr[i], arr[j]);
}
}
}
int main() {
vector<int> arr = {3,7,12,99,231,4,-6,-77,10};
selectionSort(arr);
for(auto it : arr) cout << it << " ";
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
