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

9 votes214 views3 answers
C++ find element in vector
C++
2 votes198 views1 answer
Getch c++ library
C++
0 vote202 views1 answer
Cyclic array rotation in cpp
C++
1 vote211 views1 answer
How to find the individual letters of a string c++
C++
4 votes199 views1 answer
Fork was not declared in this scope
C++
0 vote222 views1 answer
Time and date (tm structure ) in C++
C++
5 votes184 views1 answer
C++ - include all libraries
C++
0 vote181 views1 answer
C++98 check if character is integer
C++
5 votes191 views3 answers
C++ console color
C++
0 vote211 views1 answer
Reading package lists... Done Building dependency tree Reading state information... Done mysql-server is already the newest version (5.7.36-0ubuntu0.18.04.1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
C++