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 comparison between elements is then performed. [END QUOTE] I was too concentrated on splitting one array recursively, and ignored the second array splitting, entirely. Also, the part about splitting each array in half until only a single element exists in each array, and then comparing those elements. Leaves me wondering "What are we trying to do here", because in the recursive splits, out of the entire 2 arrays, we're only comparing two, oddly chosen, elements. Are we looking to take the upper half of each split array, or the lower? Maybe the upper on odd numbered splits, and the lower on even-numbered splits? I'm plainly baffled by the larger job we're doing here. The coding in C or BASIC, doesn't appear the problem - that's easy enough. The purpose and suitability of the code, seems quite more difficult. Would you help fill in the gaps on this, Cosmo? Typically, programs made for things like this are worthless because the OP failed to mention this, that, and the other "detail". Adak Any recommendations on how you could loop through all elements recursively, only checking those which have not already been checked. The main issue is figuring out how to keep track of those which have been checked and those which are still remaining. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
