Dynamic order statistics OS-SELECT(i, S): returns the ith smallest element in the dynamic set S. OS-RANK(x, S): returns the rank of x ∈ S in the sorted order of S’s elements. IDEA: Use a red-black tree for the set S, but keep subtree sizes in the nodes
Solubility limit for P at 1273 K is Co 2 1 x 10 cm\. Intrinsic carrier concentration is 10 cm\. Thus, before including higher order terms, Do=13x10-4 cm2/s. But with first order and second order correction terms
The Law of Total Probability is handy tool for breaking down the computation of a prob- ability into distinct cases. More precisely, suppose we are interested in the probability of an event E: Pr(). Suppose also that the random experiment can evolve in two different ways; that is, two different cases X and X are possible. Suppose also that it is easy to find the probability of each
