Selection sort c++ algorithm

C++ code for selection sort

#include<bits/stdc++.h>
using namespace std;

int main(){
    //selection sort
    
    int a[5] = {54,69,12,2,89};
    //find minimum in rest of the array and swap with the current index;
    //if(n>1)
    for(int i=0;i<5-1;i++)
    {
        int minloc = i;
        for(int j=i+1;j<5;j++)
        {
            if(a[minloc]>a[j])
            {
               minloc = j;
               
            }
        }
        swap(a[i],a[minloc]);
    }
    for(int i=0;i<5;i++)
    {
        cout<<a[i]<<" ";
    }
    return 0;
}

Selection sort c++ algorithm

//Selection sort algorithm
selectionSort(array, size)
  repeat (size - 1) times
  set the first unsorted element as the minimum
  for each of the unsorted elements
    if element < currentMinimum
      set element as new minimum
  swap minimum with first unsorted position
end selectionSort

Similar codes

5 votes291 views1 answer
Qdebug
C++
0 vote297 views1 answer
Glew32.dll was not found
C++
2 votes287 views1 answer
How to convert string to wchar_t in c++
C++
0 vote292 views1 answer
How to print items in c++
C++
5 votes292 views1 answer
How to use comparator funtion in priority queue in c++
C++
4 votes313 views2 answers
Vector.find()
C++
56 votes355 views6 answers
List conda environments
C++
0 vote338 views1 answer
Split 2d array into chunks in c++
C++
0 vote307 views6 answers
Gcd
C++
0 vote300 views1 answer
Generate random double c++
C++