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

-2 votes131 views2 answers
Constants in cpp
C++
8 votes166 views10 answers
Never gonna give you up
C++
1 vote125 views1 answer
Set cmd size c++
C++
-1 vote145 views1 answer
How to pass arrays by reference c++
C++
0 vote125 views1 answer
C++ define constant in class header
C++
1 vote123 views2 answers
C++ function as paramter
C++
9 votes134 views4 answers
C++ vector print
C++
0 vote121 views1 answer
While(n--)
C++
1 vote119 views1 answer
What is time complexity of min_element()
C++
1 vote115 views1 answer
Iff arduino
C++