A connected graph G is a cactus if any two of its cycles have at most one common vertex. This article is a survey of results concerning cacti with a given spectral property, categorized as follows: (1) extremal cacti, (2) reflexive cacti.