2 Replies Latest reply: Nov 5, 2009 6:04 AM by 843853 RSS

    question about algorithms

    843853
      I need to make a divide&conquer algorithm for finding the dominant element in an array (dominant element = element which exists at least n/2 times in an array within the size n) . All you can do between those elements is compare them (no < relation or > relation) .
      Please help me because I'm really lost here...
        • 1. Re: question about algorithms
          796262
          efwa wrote:
          I need to make a divide&conquer algorithm for finding the dominant element in an array (dominant element = element which exists at least n/2 times in an array within the size n) . All you can do between those elements is compare them (no < relation or > relation) .
          Please help me because I'm really lost here...
          Which part do you need help with? What have you tried so far? What worked? What didn't (and how didn't it) work?
          • 2. Re: question about algorithms
            843853
            [deleted]

            Edited by: BIJ001 on 2009.11.05. 13:03