1, red smiley with pset3 helpers, need help

Question

Im so close to completing this program and i just need someone to look over it and tell me whats wrong. Im getting close to my wits end but if they could help me i would send them my code to look at so as to not post the entirety. i think it might be my sorting: { // TODO: implement an O(n^2) sorting algorithm

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

    for (int j = 1; j < n; j++)
    {
        if(values[min] > values[j])
        {
            min = j;
        }

        int temp = values[min];
        values[min] = values[i];
        values[i] = temp;
    }
}
return;

}

Answer 1

This is a Selection Sort algorithm, I think the problem is in the declaration

int min = 0;

Every time the outermost loop min is always zero, what interests us is that there is a variable that stores the min value, if you think about it a little you should be

int min = i;

I hope this helps