This paper is not a complete survey on randomized algorithms in comput
ational geometry, but an introduction to this subject providing intuit
ions and references. First, some basic ideas are illustrated by the so
rting problem, and then a few results on computational geometry are br
iefly explained.