We study fixed points in compositions (ordered partitions) of integers and words. A fixed point is a point with value i in position i. Using generating functions and probabilistic arguments, we enumerate the compositions and words with no fixed points and p fixed points and also how many fixed points occur on average. We briefly discuss the average maximum (respectively minimum) fixed point and the sum of sizes of fixed points. Moreover we provide asymptotic results for the above parameters.