Welford's algorithm for variance is this type of algorithm.  
Welford's algorithm for variance is this type of algorithm.  Ukkonen's algorithm for making suffix trees is  linear and this. A classical problem for the study of these algorithms is the Secretary Problem. One strategy  for this type of algorithm in the List Update Problem is move-to-front. The performance of these algorithms  to more traditional approaches is characterized by their competitive ratio. The answer to this question is not  greedy, but LRU is this type of caching algorithm. For 10 points, name these algorithms acting on a stream of inputs  that have to make choices step by step as the input comes in and without knowing future values in the stream.
Welford's algorithm for variance is this type of algorithm.  
online algorithm [be overly generous and prompt on “greedy”]