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++

void swap(int &a, int &b)
{
    int temp = a;
    a = b;
    b = temp;
}
void Tri_Selection(int tab[],int n)
{
    for (int i=0; i<n; i++)
    {
        for (int j=i+1; j<n; j++)
            if (tab[i] > tab[j])
                swap(tab[i],tab[j]);
    }
}

Similar codes

3 votes152 views1 answer
Find in set of pairs using first value cpp
C++
2 votes154 views1 answer
Built in function in c++ for binary to decimal
C++
1 vote170 views1 answer
Prime number generator c++
C++
0 vote174 views1 answer
Initialisation of a c++ variable
C++
11 votes160 views1 answer
Removing a character from a string in c++
C++
1 vote158 views3 answers
Print 2d array c++
C++
14 votes158 views1 answer
How to make a n*n 2d dynamic array in c++
C++
0 vote170 views1 answer
16630147
C++
13 votes154 views5 answers
Max of a vector c++
C++
0 vote159 views1 answer
C++ foreach vector
C++