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 vote141 views2 answers
Tu hi hai aashiqui song lyrics
C++
1 vote135 views1 answer
How to block window resize sfml c++
C++
0 vote149 views2 answers
How can we create 4 digit random number in c++
C++
0 vote137 views1 answer
Check whether kth bit is 1
C++
1 vote129 views2 answers
Calling by reference c++
C++
2 votes135 views1 answer
C++ endl
C++
8 votes133 views1 answer
Remove last letter in string c++
C++
0 vote125 views1 answer
Input n space separated integers in c++
C++
0 vote136 views3 answers
Print counting in c++
C++
9 votes171 views2 answers
Sort vector in reverse order c++
C++