> understanding the big-O complexity of each operation (…and ensuring that none of your interactions are more than logarithmic). This is a good idea, maybe a p

> understanding the big-O complexity of each operation (…and ensuring that none of your interactions are more than logarithmic). This is a good idea, maybe a prompt for another post.