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

1 vote236 views1 answer
Qt label set text color
C++
7 votes206 views5 answers
Set precision in c++
C++
0 vote192 views1 answer
Convert kelvin to Fahrenheit
C++
0 vote243 views1 answer
Tic toc toe c++
C++
0 vote235 views2 answers
Tu hi hai aashiqui song lyrics
C++
20 votes202 views2 answers
Find height of a tree
C++
0 vote202 views3 answers
Best gun in freefire for headshot
C++
1 vote200 views1 answer
Cuda dim3
C++
2 votes204 views1 answer
C++ print colorful
C++
0 vote223 views1 answer
Function to calculate compound interest in C++
C++