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

5 votes334 views6 answers
Binary search algorithm
C++
0 vote312 views1 answer
Omp multiple reductions
C++
0 vote317 views1 answer
Find maximum sum of circular subarray
C++
0 vote294 views1 answer
Basic stack implementation in c++
C++
17 votes308 views4 answers
Max element in vector c++
C++
19 votes294 views6 answers
Initialize 2D vector
C++
7 votes271 views1 answer
C++ create class from class name
C++
0 vote298 views1 answer
InstallUtil.exe ConsoleApp
C++
16 votes320 views3 answers
Console clear c+
C++
0 vote293 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++