Given the following set: {-5, -3, -2, 1, 2, 4}, find the subsets
that will sum to zero. Solve the problem using a fixed tuple state
space tree.
a. Explain the algorithm to search for the subsets using the
given example. (4 marks)
b. What is the worst case time complexity? Justify your answer.
(4 marks)
Given the following set: {-5, -3, -2, 1, 2, 4}, find the subsets that will sum to zero. Solve the problem using a fixed
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am