Sorting an array using recursion

[antirsi96]

Hi! I am having some problems figuring out what is wrong with my code here. I need to sort an array of n given elements using recursion. What am i doing wrong here?

#include <iostream>
using namespace std;
int i=0, j=1, v[100], n;
void sort()
{
    int aux;
    if(j!=n){
        if(v[i]>v[j])
        {
            aux=v[i];
            v[i]=v[j];
            v[j]=aux;
        }
        i++;
        j++;
    }
    sort();
}
void citire()
{
    for(int q=1;q<=n;q++)
        cin>>v[q];
}
void afisare()
{
    for(int q=1;q<=n;q++)
        cout<<v[q]<<" ";
}
int main()
{
    cin>>n;
    citire();
    cout<<endl;
    afisare();
    cout<<endl<<endl;
    sort();
    afisare();
    return 0;
}

[Catfish666]

You have infinite recursion. The sort() function will keep calling itself until you stop the program.

void sort()
{
    sort(); // sort, sort, sort, sort, sort, sort...
}

Every time you write a recursive function, you must include a stop condition before calling recursively.

void sort()
{
    if (/* can call again */)
        sort();
}

Were you told to implement a sorting algorithm and use recursion?

See this page for explanations for various algorithms. (See Quicksort which uses recursive calls.)
http://www.cplusplus.com/faq/sequences/sequencing/sort-algorithms/

[antirsi96]

Thanks!