The '''Schreier–Sims algorithm''' is an [[algorithm]] in [[computational group theory]] named after mathematicians [[Otto Schreier]] and [[Charles Sims (mathematician)|Charles Sims]]. OnceThis performed,algorithm itcan allows a linear time computation offind the [[Order (group theory)|order]] of a finite permutation group, group test membership test (is a given permutation contained in a group?), and many other tasks. in Thepolynomial algorithmtime. It was introduced by Sims in 1970, based on [[Schreier's subgroup lemma]]. The timing was subsequently improved by [[Donald Knuth]] in 1991. Later, an even faster [[Randomized algorithm|randomized]] version of the algorithm was developed.
