Question

The following code snippet is for C++

int selection_Sort(int A[ ], int n)

{

int I, j, small, temp;

for( i = 0; i < n-1; i++)

{

small = i;

for(j = i + 1; j < n; j++)

{

if ( A[ j ] < A[ small ]

small = j;

}

temp = A [ i ];

A[ i ] = A[small];

A[small] = temp;

}

}

Please explain in rich detail the logic behind every execution and why it does what it does according to the format that the code has! I am really trying to understand how this all works and runs! Thank you in advance!

Answer 1

Please upvote if you like this answer.

CODE:

#include <iostream>
using namespace std;
int selection_Sort(int A[], int n)
{
   int i, j, small, temp;
   for( i = 0; i < n-1; i++)
   {
     small = i;
     for(j = i+1; j < n; j++)
     {
       if ( A[j] < A[small])
       {
          small = j;
       }
    }
      temp = A [i];
      A[i] = A[small];
      A[small] = temp;
   }   
}
int main()
{
    int arr[] = {5,6,2,3,1};
   cout << "given array is : 5,6,2,3,1 \n" ;
    int n = sizeof(arr)/sizeof(arr[0]);
   int i;
    selection_Sort(arr, n);
    cout << "Sorted array is: \n";
   for (i=0; i < n; i++)
        cout << arr[i] << " ";
    
    return 0;
}
OUTPUT:

EXPLANATION: