One Stop GATE Forum: algorithm

Message

   Describe 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.

Author	Message
vidhya Groupie Joined: 27Mar2007 Location: India Online Status: Offline Posts: 48	Topic: algorithm Posted: 27Mar2007 at 11:59pm
	Describe 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. Post Resume: Click here to Upload your Resume & Apply for Jobs

	IP Logged


One Stop GATE Forum : GATE Technical Discussions : GATE CS

Topic: algorithm