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

0 vote153 views1 answer
Sum of first and last digit of a number in C++
C++
0 vote102 views1 answer
Case 1 or 2 c++
C++
1 vote143 views1 answer
C++ check if debug or release visual studio
C++
0 vote156 views2 answers
How to create array with not constant size in cpp
C++
0 vote147 views1 answer
Double array size c++
C++
2 votes141 views6 answers
Loop in c++
C++
0 vote157 views1 answer
The number of ones int bitset
C++
1 vote150 views1 answer
While until c++
C++
0 vote148 views1 answer
C++ recorrer string
C++
0 vote173 views1 answer
_ZNSolsEi
C++