# I’m fighting with the theoretical

I’m fighting with the theoretical part of my computer assignment right now. I didn’t really have many problems with the programming. Two ordered dictionaries, S and T, describe an O(log^2) algorithm to find the key greater than exactly n keys in the union of S and T (given there are 2n keys and no duplicates).