This is an exercise in matching largest possible combinations of positive and
negative values for a given field in the database so that their values offset each
other. This information is relevant to certain systems of book keeping.
In order to achieve best results, at the same time avoiding unaffordable slowing
down in processing each and every possible combination (the number of
theoretically possible combinations can become astronomically huge as the total
number of records in the database increases), following sort sequence is adopted
for positive and negative values before computing their running sums, which in turn
are subjected to cartesian comparison 
(a) Pos Asc, Neg Asc
(b) Pos Asc, Neg Desc
(a) Pos Desc, Neg Asc
(a) Pos Desc, Neg Desc
(a) Pos Random, Neg Random Download Access 2000: http://www.rogersaccesslibrary.com/forum/uploads/37/MatchCombinations_2K.zip  uploads/37/MatchCombinations_2K.zip
 
Email: mailto:adtejpal@gmail.com  adtejpal@gmail.com
