Given an array of length n of integer numbers. Output 1 or 0 depending on whether or not there exists a sub sequence in the array with sum S. Suggest a fastest algorithm plz.
e.g. say given an array with numbers as 10 20 30 40 50 60 70 Sum = 110 Output is 1 because 20+30+50 is 110. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
