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 vote187 views1 answer
Cmd color text c++
C++
0 vote182 views1 answer
Cpp pointer to two dimensional array
C++
0 vote188 views1 answer
Glm multiply vector by scalar
C++
1 vote153 views1 answer
How to print fixed places after decimal point in c++
C++
1 vote172 views1 answer
Operator precedence in cpp
C++
0 vote170 views1 answer
Semi colon in argument list c++
C++
0 vote183 views1 answer
Sort using lambda c++
C++
20 votes168 views5 answers
How to print in c++
C++
6 votes136 views2 answers
What is heap buffer overflow
C++
1 vote171 views1 answer
Pyramid shape in c++
C++