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 vote299 views1 answer
C++ read_ascii
C++
0 vote306 views1 answer
Rotation 2d d'un point
C++
0 vote331 views1 answer
C++ uint32_t
C++
2 votes305 views1 answer
Unordered_map of pair and int
C++
-1 vote306 views1 answer
How to rename a file in cpp
C++
0 vote318 views1 answer
C++ freecodecamp course 10 hours youtube
C++
0 vote297 views1 answer
C++ preprocessor commands
C++
0 vote289 views1 answer
Is there garbage collection in c++
C++
0 vote290 views1 answer
Even and odd sum in c++
C++
0 vote300 views1 answer
C++ do every 1 minutes
C++