<div>
void SortBySelec(int* a; int n);<br />
{<br />
&nbsp; &nbsp; if(n == 1) retun;<br />
&nbsp; &nbsp; int j = 0; <br />
&nbsp; &nbsp; for(int i=1; i&lt;n; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp;if(a[i] &lt;&nbsp;a[0])<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;j = i;<br />
&nbsp; &nbsp; a[0] = a[j];<br />
&nbsp; &nbsp; SortBySelec(&amp;a[1], n-1);<br />
}<br />

</div>


void SortBySelec(int* a; int n);
{
    if(n == 1) retun;
    int j = 0;
    for(int i=1; i<n; i++)
       if(a[i] < a[0])
           j = i;
    a[0] = a[j];
    SortBySelec(&a[1], n-1);
}


<div>
<div class="content wysiwyg-content">
Hello<br />
&nbsp; I want the algorithm of :<br />
&nbsp; &nbsp; &nbsp; &nbsp;Sort By Selection function of a array of integer elements &nbsp;<br />
&nbsp; &nbsp;by RECURSION .<br />
&nbsp; <br />
&nbsp; SortBySelec(int a[]; int n);<br />
&nbsp; {<br />
&nbsp; }<br />
<br />
&nbsp;Thanks....................<wbr />.
</div>
</div>


Hello
  I want the algorithm of :
       Sort By Selection function of a array of integer elements  
   by RECURSION .
  
  SortBySelec(int a[]; int n);
  {
  }

 Thanks.....................

Sort By Selection Algorithm By RECURSION

C++ is an intermediate-level general-purpose programming language, not to be confused with C or C#. It was developed as a set of extensions to the C programming language to improve type-safety and add support for automatic resource management, object-orientation, generic programming, and exception handling, among other features.