Maximizing XOR Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Bit Manipulation
  4. Maximizing XOR
  5. Discussions

Maximizing XOR

  • furskytl + 1 comment

    I think it can be O(logR) complexity.

    • benpfisher + 1 comment

      It can be better than log(R). If R and L are 4 byte integers, it can be done in 31 steps worst case.

      • Goodwine + 1 comment

        No, it's not worse, it's the same.
        What you are saying is log2(R).

        • xshanz + 2 comments

          in computer science, log(n) means log2(n)

          • jameseamaya + 1 comment

            lg(n) means log2(n), log(n) means log10(n). usually

            • aonurdemir + 0 comments

              no it is not

          • mah61 + 0 comments

            doesn't matter, logs of any base are big-O equivalent