By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
446,421 Members | 1,053 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 446,421 IT Pros & Developers. It's quick & easy.

divide-and-conquer max position

P: 1
I need some help writing an algorithm (pseudocode is fine too) for a divide-and-conquer technique for determining the position of the max element in an unsorted array. Any help would be appreciated
Mar 8 '07 #1
Share this Question
Share on Google+
1 Reply


sicarie
Expert Mod 2.5K+
P: 4,677
I need some help writing an algorithm (pseudocode is fine too) for a divide-and-conquer technique for determining the position of the max element in an unsorted array. Any help would be appreciated
Interesting... if the array is unsorted, I wouldn't recommend divide an conquer at all - if it is, then it's at one of the ends... Sadly, assignments in class are much like those in real life - definitely not the best way to go about it, and leaving you with little to no control over it.

As this seems like a class assignment, the instructor has probably at least mentioned the algorithm in class. What do you have so far?
Mar 8 '07 #2

Post your reply

Sign in to post your reply or Sign up for a free account.