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

1 vote133 views1 answer
C++ strings equal
C++
0 vote136 views1 answer
Cpp console progressbar
C++
0 vote143 views1 answer
Vector stop at newline
C++
0 vote139 views1 answer
A variable with 2 independant variables plot
C++
0 vote158 views1 answer
Is variable sized array are not allowed in c++?
C++
0 vote152 views1 answer
How to find size of int array in c++
C++
0 vote145 views1 answer
Input n space separated integers in c++
C++
13 votes124 views27 answers
Cpp hello
C++
0 vote99 views1 answer
Scss variable is not defined
C++
7 votes153 views6 answers
Sleep in c++
C++