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

15 votes259 views4 answers
How to make a random number in c++
C++
0 vote275 views1 answer
Cpp console progressbar
C++
1 vote278 views1 answer
Qt rotate qimage
C++
15 votes293 views3 answers
String to char array c++
C++
0 vote264 views1 answer
Qt asynchronous HTTP request
C++
1 vote273 views1 answer
SFML window
C++
0 vote289 views1 answer
How to read qlistwidget in c++
C++
2 votes304 views2 answers
Palindrome checker in c++
C++
1 vote289 views1 answer
GetCurrentThreadId c
C++
7 votes275 views6 answers
Sleep in c++
C++