When such group is finite (has finite order), say it has "n" elements, one can think of this group as the set of those shuffles (one-to-one functions) of "n" elements. The symmetric group given on "n" elements is often written as formula_2.
w ɛ n WORD_BOUNDARY s ʌ t̠ʃ WORD_BOUNDARY ɡ ɹ uː p WORD_BOUNDARY ɪ z WORD_BOUNDARY f aɪ n aɪ t WORD_BOUNDARY h ʌ z WORD_BOUNDARY f aɪ n aɪ t WORD_BOUNDARY ɔ ɹ d ə ɹ WORD_BOUNDARY s eɪ WORD_BOUNDARY ɪ t WORD_BOUNDARY h ʌ z WORD_BOUNDARY ɛ n WORD_BOUNDARY ɛ l ɪ m ə n t s WORD_BOUNDARY w ʌ n WORD_BOUNDARY k æ n WORD_BOUNDARY θ ɪ ŋ k WORD_BOUNDARY ʌ v WORD_BOUNDARY ð ɪ s WORD_BOUNDARY ɡ ɹ uː p WORD_BOUNDARY æ z WORD_BOUNDARY ð ə WORD_BOUNDARY s ɛ t WORD_BOUNDARY ʌ v WORD_BOUNDARY ð oʊ z WORD_BOUNDARY ʃ ʌ f ə l z WORD_BOUNDARY w ʌ n t ə w ʌ n WORD_BOUNDARY f ʌ ŋ k ʃ ə n z WORD_BOUNDARY ʌ v WORD_BOUNDARY ɛ n WORD_BOUNDARY ɛ l ɪ m ə n t s WORD_BOUNDARY ð ə WORD_BOUNDARY s ɪ m ɛ t ɹ ɪ k WORD_BOUNDARY ɡ ɹ uː p WORD_BOUNDARY ɡ ɪ v ə n WORD_BOUNDARY ɔ n WORD_BOUNDARY ɛ n WORD_BOUNDARY ɛ l ɪ m ə n t s WORD_BOUNDARY ɪ z WORD_BOUNDARY ɔ f ə n WORD_BOUNDARY ɹ ɪ t ə n WORD_BOUNDARY æ z WORD_BOUNDARY f ɔ ɹ m j ʊ l ə WORD_BOUNDARY t uː WORD_BOUNDARY