Thanks for the suggestions Adak but I've since managed to achieve what
I was looking for. I didn't give more indepth information as I was
looking to solve the remainder myself.
Much appreciated,
Cosmo
--~--~-~--~~~---~--~~
You received this message because you
Hi again, Cosmo
I was re-reading your original post, and I'm a bit stuck on the
ambiguities of English contained therein.
[BEGIN QUOTE]
I'm trying write a recursive divide and conquer function that will keep
splitting 2 arrays of int[] in half until a single element exists in
each array. A com
OK, you're getting let's say, to the last element in the array. Way
deep.
you test it with if (a.length == 1) and yep, we're at the last element,
so you set the change to "true".
Now it's time to EXIT the program. If I understand your code, it's ONLY
designed to recurse DOWN, so
if you go back U
Thanks for the prompt reply Adak. I've looked at some of the quicksort
examples and I know they use recursion and divide & conquer for
implementation but I'm having difficulty extracting the pieces relevent
to me. Here is what I have so far, it currently generates a stack
overflow error so it's n
Let the recursive call stack keep track of that, just take a look at
demo's of Quicksort, and you'll see what I'm talking about. You'll
probably want a left and right index or pointer, (or call them low and
high, whatever you like).
Adak
--~--~-~--~~~---~--~~
You
