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 vote235 views2 answers
Generating unique id for an object in c++
C++
4 votes219 views3 answers
Pi in c++
C++
0 vote268 views1 answer
Export gcc g++
C++
0 vote230 views1 answer
Std::set remove item
C++
1 vote178 views1 answer
Can we create array inside an array in c++
C++
0 vote367 views1 answer
Why constructor can't be static in c++
C++
10 votes213 views3 answers
Conditional operator in c++
C++
0 vote244 views1 answer
C++ Calculating the Mode of a Sorted Array
C++
-1 vote229 views1 answer
Permutation c++
C++
2 votes261 views2 answers
Resize two dimensional vector c++
C++