Solves
selection
Articles
DS
Data structure
Binary search tree
Smaller to the left, larger to the right: search, order and the k-th element in the tree's height, from log n to n.
O(h): from O(log n) to O(n)
2 problems
PAR
Technique
Divide and conquer
Cut, solve the parts the same way, glue; what it costs follows from the levels of the recursion tree and the master theorem.
T(n) = a·T(n/b) + f(n)
2 problems
Often together
classic 2 interviews 2 search tree 1 tree 1 searching 1 range queries 1 databases 1 divide and conquer 1 recursion 1 sorting 1 parallel 1 contests 1