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 vote152 views1 answer
Max two numbers c++
C++
0 vote153 views1 answer
System("pause") note working c++
C++
0 vote152 views1 answer
Kadane algo
C++
1 vote166 views1 answer
Collections c# vs c++
C++
7 votes182 views5 answers
Sleep c++
C++
1 vote168 views1 answer
Qt double en qstring
C++
2 votes161 views2 answers
What is typedef
C++
0 vote175 views1 answer
Access first value in a set c++
C++
0 vote228 views1 answer
MPI wait
C++
0 vote165 views1 answer
C++ rename function
C++