Comment by stralep

If ordering is made by color&design, matching drops to O(n log(n)).

Again, with ordering, searching drops to O(log n)