Today I reviewed online algorithms and summary it now.
1. LRU is k-competitive;
2. LFU cannot achieve a constant competitive ration;
3. Randomized algorithms: O(ln k)-competitive.
Online Algorithms
原文：http://www.cnblogs.com/dhgtfui/p/4136311.html
