[eveningcoffee]

I think this indeed would be a better approach.

Instead of asking about Bubble sort, ask what is generally the complexity of a naive sorting algorithm and how good it can get for a general case.

I have investigated immutable hash tables but I do not know much about concurrent hash tables. This is my blind spot, so I do not know what the relevant question about the Hopscotch hashing would be.

Instead of asking what is CAP theorem, ask if you can make a distributed system with consistency and availability at the same time.

I think that this was the intention behind these questions after all and is the reason why I am trying to argue in support of them.