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

4 votes354 views2 answers
C++ stream string into fiel
C++
0 vote328 views1 answer
Move mouse c++
C++
0 vote406 views1 answer
Flutter websocket auto reconnect
C++
4 votes348 views3 answers
Check lowercase letters c++
C++
2 votes331 views1 answer
Cpp starting code
C++
-1 vote309 views1 answer
#include
C++
-1 vote358 views1 answer
Fast way to check if a number is prime C++
C++
3 votes392 views2 answers
C++ first letter of string
C++
0 vote348 views1 answer
Convert char to C
C++
0 vote319 views1 answer
Pascal's triangle in c++ through pointer
C++