Need an exhaustive search algorithm for problem below (please write the proper puesdocode, not just an explanation, for this question or I will downvote your answer)

Suppose n positive integers are given to you. Partition these numbers into two disjoint subsets in a way that both subsets have the same total sum. Try to make sure that your algorithm works for all possible inputs, you should consider cases when the input has no solutions and return appropriately.

If there is any need to generate permutations or subsets, please just write generate all subsets."