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 views10 answers
Online compiler c++ with big O calculator
C++
4 votes183 views1 answer
Arduino uno hello world
C++
0 vote94 views1 answer
Filling 2d array with 0 c++
C++
0 vote101 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
23 votes100 views1 answer
How to declare a function in c++
C++
6 votes95 views2 answers
Stack erase
C++
1 vote107 views1 answer
C++ power
C++
0 vote89 views1 answer
C++ convert integer to digits, as vector
C++
1 vote130 views1 answer
Stack implementation using linked list in cpp
C++
0 vote99 views1 answer
Cpp create lambda with recursion
C++