Default How to approach finding the best match (service) for stated options?

Imagine a couple dozen services, each of which has some (but not all) available options. I want to create a web form listing all possible options so that users can check the boxes for the options they want, then, after the form is submitted, return a report listing the services from best match to worst, with an analysis of each. (E.g. Service A provides all your desired options except for Options J and Q. Service B offers Option J but does not include Options Q, X and Z…)

I’m having trouble wrapping my brain around the best way to go about this. I thought about using bitwise operations but I’ve forgotten most of what I once knew about bitwise operations.

I’d appreciate any suggestions.

array_intersect, usort by count

This topic was automatically closed 91 days after the last reply. New replies are no longer allowed.