[Webinar] Streamline your web hosting managementRegister Today

x
Solved

# Sort By Selection Algorithm By RECURSION

Posted on 2002-05-27
Medium Priority
191 Views
Last Modified: 2010-04-02
Hello
I want the algorithm of :
Sort By Selection function of a array of integer elements
by RECURSION .

SortBySelec(int a[]; int n);
{
}

Thanks.....................
0
Question by:RamiScience
3 Comments

LVL 31

Expert Comment

ID: 7038525
Homework?
0

Accepted Solution

TheLord earned 800 total points
ID: 7038584
0

LVL 22

Expert Comment

ID: 7038623
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);
}
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Written by John Humphreys C++ Threading and the POSIX Library This article will cover the basic information that you need to know in order to make use of the POSIX threading library available for C and C++ on UNIX and most Linux systems.   [s…
Introduction This article is the first in a series of articles about the C/C++ Visual Studio Express debugger.  It provides a quick start guide in using the debugger. Part 2 focuses on additional topics in breakpoints.  Lastly, Part 3 focuses on th…
The goal of the video will be to teach the user the difference and consequence of passing data by value vs passing data by reference in C++. An example of passing data by value as well as an example of passing data by reference will be be given. Bot…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
###### Suggested Courses
Course of the Month7 days, 19 hours left to enroll

#### 607 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.