Declare time variables like such

clock_t start, end;

start=clock();
end=clock();

cout<<"the total elapsed time is: "<<(end-start)/CLK_TCK<<"seconds"<<endl;

CLK_TCK is a predefined...

Big O is a measure of compelexity.

Basically, in laymans terms, it means the highest amount of complexity an algorithm will contain.

Mathmatically, for me its easier to understand.

IE

in...

Thats what I did, I found that the threshold value for the size of arrays I was dealing with would show increased efficiency at around 25 and lower.

void quickSort(int numbers[], int array_size)
{
q_sort(numbers, 0, array_size - 1);
}


void q_sort(int numbers[], int left, int right)
{
int pivot, l_hold, r_hold;

Recently we have been asked to create a hybrid sort based upon quicksorting down to a certain point and insertion sorting from then on. We are to calculate the efficency based upon previous tests. I...