Talk:TADM2E 4.6

From Algorithm Wiki
Revision as of 19:16, 19 May 2017 by Durumu (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

What about this approach?

  • Create a hash entry for every value from S1[i].
  • For each value in S2 look for a hash hit on x-S2[i].

Isn't that an O(n) solution?

According to the formal definition, an O(n) solution is also an O(n log n) solution, is it not?