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 vote151 views1 answer
How to turn an integer variable into a char c++
C++
0 vote211 views1 answer
Flake8 max line length
C++
1 vote158 views2 answers
Rotate in cpp
C++
1 vote158 views1 answer
Doubly linked list c++ code
C++
5 votes163 views3 answers
Convert vector to set c++
C++
1 vote181 views1 answer
Get a string from file in c++
C++
1 vote159 views2 answers
Insert vector to end of vector c++
C++
0 vote393 views1 answer
Stack overflow c++
C++
0 vote170 views1 answer
Opencv(4.5.1) c:\users\appveyor\appdata\local\temp\1\pip-req-build-kh7iq4w7\opencv\modules\imgproc\src\resize.cpp:4051: error: (-215:assertion failed) !ssize.empty() in function
C++
10 votes131 views2 answers
Last index of string c++
C++