Hi, 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.
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. Thanks in advance, Cosmo --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
