'Avlnode tmp' presentation slideshows

Josephus problem

0. 4. 1. 3. 2. 2. 1. 3. 0. Josephus problem. N=5, K=3. (J(N-1, K) + K) mod N = J(N, K) J(1, K) = 0. Ak K=2 a N = b0b1b2b3...bn J(N, 2) = b1b2b3...bnb0. http://www.cut-the-knot.org/recurrence/flavius.shtml. Stack - interface. public interface Stack<E> { public int size ();

620 views • 43 slides