> O(n^2) listening: cross-comparing all the things they've said for informational pairings
If you manage to think of a good hash function for everything they say, you can use a hash table and cross-check every new thing they say in O(1), which makes the total complexity O(n).