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 vote127 views1 answer
Factorial using recursion cpp
C++
0 vote134 views1 answer
Shell-Sort C++
C++
0 vote153 views2 answers
Memory leak in cpp
C++
13 votes127 views3 answers
Python remove repeated characters from string
C++
0 vote123 views1 answer
C++ void to avoid functions
C++
2 votes139 views2 answers
C++ in cmd
C++
0 vote147 views4 answers
How to make a square root function in c++ without stl
C++
0 vote145 views1 answer
Use declaration to define a variable
C++
7 votes89 views1 answer
Remove from the front of a vector
C++
6 votes128 views3 answers
Sstream c++
C++