Ad
  • Default User Avatar
    1. You are wrong - to sort primitives Java uses the so-called Dual-Pivot Quicksort. This algorithm is based on quicksort, as obvious from its name, but in fact, comprises many technics to ensure linear-logarithmic performance even with the massive data.

    2. Your solution is computationally intensive as well, it performs iteration through the entire array B for every element in array A. That gives O(n * m) time complexity.
      And this task can be solved in a linear time (try to refine your algorithm, or you may look at my solution).
      Additionally, your code has a side effect - it mutates array B.

  • Custom User Avatar

    What language?