Problem Statement: While matching rules(say l) for an incoming Transactions ( say m) for customers (say k), total comparison operations are k*l*m. If k,l,m are too large then it would cost lots of time with worst time complexity as O(k*l*m).
Requirement: Less Time Complex Solution, Precision
Happy flow Example: There are 3 customers C1, C2, C3 and each has a rule R1, R2, R3 respectively.
R1 - Name contains <SYSCO INTL CO>
R2- Name contains <SYSCO INTL>
R3 - Name contains <SYSCO INTL INC>
An OFX/xml file with memo tag for one of the transactions(T1) has name as <SYSCO INTL COM>.
T1*number of rules*number of customers (1*3*3) is easy. However, as transactions list and rules list go high, it will be difficult to make a linear search comparison.
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)