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 vote284 views1 answer
Inverted triangle c++
C++
7 votes249 views1 answer
How to make string get spaces c++
C++
0 vote275 views1 answer
Dfs program in c++
C++
-1 vote276 views1 answer
React cookie
C++
1 vote258 views1 answer
Qtextedit no line break
C++
0 vote270 views1 answer
Result += a +b in c++ meaning
C++
0 vote239 views4 answers
C++ initialize vector of vector with size
C++
0 vote292 views1 answer
C create 1 bit value
C++
0 vote239 views1 answer
C++ tab
C++
2 votes239 views1 answer
Binary search return index c++
C++