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 vote174 views1 answer
Print the elements of the array without using the [] notation in c++
C++
3 votes168 views1 answer
C++ program to reverse an array
C++
0 vote226 views1 answer
Pop back innstring
C++
0 vote165 views1 answer
C++ file handiling
C++
0 vote170 views6 answers
Python converter to c
C++
3 votes202 views3 answers
Largest Subarray with Zero Sum
C++
10 votes174 views2 answers
Why convert char* to string c++
C++
0 vote163 views1 answer
Initialize multiple variables to 0 c++
C++
0 vote154 views1 answer
C++ shift array to the right
C++
0 vote191 views2 answers
How can we create 4 digit random number in c++
C++