C++

Forum

Windows Programming - November 2010 (Page 6)

by tantel
Divide and Conquer Algorithm
let A[1…n] be an array of integers. Design an efficient divide and conquer algorithm to determine if A contains a majority element, i.e. an element appears mo...
Nov 1, 2010 at 3:02am
[no replies]
November 2010 Pages: 1... 456
  Archived months: [oct2010] [dec2010]

This is an archived page. To post a new message, go to the current page.
Registered users can post in this forum.