The 2-SUM Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 16: | Line 16: | ||
=O(n) with Additional Space Requirements= | =O(n) with Additional Space Requirements= | ||
A better running time solution that comes with an extra space requirement, though, is to insert all numbers in a [[Hash_Table#Canonical_Use|hash table]] and then do a second pass where for each number we look to see if | A better running time solution that comes with an extra space requirement, though, is to insert all numbers in a [[Hash_Table#Canonical_Use|hash table]] and then do a second pass where for each number we look to see if t - x<sub>i</sub> exists in the table. This is a O(n) solution. | ||
Revision as of 20:35, 16 October 2021
Internal
Overview
Given as input an input of n numbers, in no particular order, and a target sum t, find all pairs of integers that sum to t.
Naive Solution O(n2)
The naive solution would be to double loop over the array in O(n2) running time.
O(n log n) with No Additional Space Requirements
A better solution would be to sort the array O(n log n), then do a linear scan over the array and for each xi element search using binary search for t - xi. Binary search on a sorted array is done in O(log n) time, so the total complexity is O(n log n) + n O(log n) = O(n log n).
O(n) with Additional Space Requirements
A better running time solution that comes with an extra space requirement, though, is to insert all numbers in a hash table and then do a second pass where for each number we look to see if t - xi exists in the table. This is a O(n) solution.