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 vote129 views2 answers
C++ string to wstring
C++
1 vote120 views1 answer
Is C++ useful in 2021
C++
0 vote137 views1 answer
01matrix
C++
3 votes139 views1 answer
Sfml draw line
C++
0 vote156 views1 answer
Get spaces in cin c++
C++
0 vote128 views1 answer
Iterate over 2 vectors c++
C++
0 vote137 views1 answer
Argument to number C++
C++
8 votes132 views3 answers
C++ check substring
C++
0 vote177 views1 answer
How to input a file path in c++
C++
0 vote143 views2 answers
If ERRORLEVEL
C++