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

0 vote255 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
1 vote270 views1 answer
C++ cout format
C++
0 vote288 views1 answer
Import matrix from excel to matlab
C++
1 vote279 views1 answer
Google test assert eq float
C++
0 vote323 views1 answer
String.begin() c++
C++
5 votes259 views1 answer
Cpp all in one header
C++
0 vote276 views1 answer
Mid of linked list
C++
0 vote300 views2 answers
Comment savoir si un nombre est premier c++
C++
0 vote282 views1 answer
How can I replace a pattern from string in c++
C++
6 votes282 views1 answer
Should i learn c or c++
C++