Search:

Do you know if Merge Sort is supposed to be quicker than Quick??
Look at the output of my project:



Sorting in progress: Please wait

***************************************************...

I cannot figure out how to write the pseudo code for this function, I need help.


void Insertion( long array[], long left, long right )
{


long i;

for( i = right; i > left; i-- )

Need help with writing pseudo codes.



void Insertion( long array[], long left, long right )
{


long i;