An introductory and selective review is presented of results obtained through a probabilistic analysis of combinatorial algorithms. The emphasis is on asymptotic characteristics of optimal solution values, and on the relative and absolute error analysis for simple heuristics.