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 vote108 views1 answer
Is vscode better than sublime
C++
23 votes111 views6 answers
String to char
C++
0 vote109 views1 answer
Bnchch
C++
0 vote123 views3 answers
How to use printf with microseconds c++
C++
0 vote96 views1 answer
Full implementation of binary search tree in C++
C++
0 vote51 views1 answer
Getting int command line arguments c++
C++
4 votes99 views3 answers
C++ vector combine two vectors
C++
3 votes95 views2 answers
How to get last element of set
C++
0 vote87 views1 answer
Map update field elixir
C++
2 votes111 views2 answers
Decltype in c++
C++