Hello all(adsbygoogle = window.adsbygoogle || []).push({});

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:

I know that you work from the left to the right. Could you somehow use the formula [tex] 2^{k} - 1 [/tex]?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));

}

Thanks a lot guys

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Recursive Ideals

**Physics Forums | Science Articles, Homework Help, Discussion**