cbyearty85061 cbyearty85061 08-09-2022 Computers and Technology contestada 3. write a pseudocode describing a θ(n lg n) –time algorithm that, given a set s of n integers and another integer x, determines whether or not there exist two elements in s whose sum is exactly x.
