Quick sort algorithm troubles

[keth802]

void quicksort(vector<int> &data, int start, int end)
{
    int i=start,j=end;
    int l;
    int tmp,pivot,closest;
    int sum=0;
    double finalsum,average,next,potential;
    for(int k=0;k<data.size();k++)
    {
        sum=sum+data[k];

    }
    finalsum=sum+0.0;
    average=finalsum/data.size();
    closest=0;
    for(l=0;l<data.size();l++)
    {
        next=abs(data[l]-average);
        potential=abs(data[closest]-average);
        if(next<potential)
        {
            closest=l;
        }
    }
    pivot=l;
    while(i<=j)
    {
        while(data[i]<pivot)
        {
            i++;
        }
        while (data[j]>pivot)
        {
            j--;
        }
        if (i<=j)
        {
            tmp=data[i];
            data[i]=data[j];
            data[j]=tmp;
            i++;
            j--;
        }
    }
    if (start<j)
    {
        quicksort(data,start,j);
    }
    if (i<end)
    {
        quicksort(data,i,end);
    }
}

This is a quicksort algorithm I wrote. I am getting REALLY WEIRD results. Somehow stuck in an infinite loop. Please help.

[kempofighter]

What do you want for someone to debug it for you? Have you tried to debug it by stepping line by line? Also if you do want help debugging you need to show us a complete, compilable function so that we can see what set of inputs you are using.