Given an array A of n integers, give an eficient algorithm to check whether there are
two numbers in A whose sum is zero.
[
priyambada1 0 Newbie Poster
Symbiatch
Not a do-my-homework site. If you have a problem with your code, we can help.
Ancient Dragon commented: absolutely :) +14
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.