# Homework Help: Recursive Ideals

1. Feb 4, 2005

Hello all

What is the difference between merge sort, selection sert,binary search , linear search and insertion sort? Also if you are given a recursive method, is there an easy way without tracing the method to find how many calls you need to make? For example:

Code (Text):

public int A(int a, int b )
{
if ( a< 0 )
return (b);
else if  (b < 1)
return (a);
else
return(A(a-2, b-4) + A(a-1, b-2));
}

I know that you work from the left to the right. Could you somehow use the formula $$2^{k} - 1$$?

Thanks a lot guys

2. Feb 4, 2005