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 vote147 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
1 vote140 views1 answer
Std::stack
C++
0 vote136 views1 answer
Checking if a string has only letters cpp
C++
0 vote158 views1 answer
C++, for-loop over an array array
C++
0 vote148 views1 answer
Faster solutions
C++
1 vote139 views1 answer
Std::queue
C++
0 vote146 views1 answer
Overloading IO Stream
C++
10 votes142 views3 answers
Integer to char c++
C++
4 votes138 views2 answers
C++ cin operator
C++
0 vote132 views1 answer
How to declare a 2D vector in c++ of size m*n with value 0
C++