Divide a group of people into two disjoint subgroups


For example, find a simple algorithm for solving the following problem and classify it using big-theta notation:
Divide a group of people into two disjoint subgroups (of arbitrary size) such that the difference in the total ages of the members of the two subgroups is as large as possible.Now change the problem so that the desired difference is as small as possible and classify your approach to the problem.

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Divide a group of people into two disjoint subgroups
Reference No:- TGS0144007

Expected delivery within 24 Hours