Groups
Matrix exponentiation turns repeated linear transitions into a single fast power of a matrix using exponentiation by squaring.
Prim's algorithm builds a Minimum Spanning Tree (MST) by growing a tree from an arbitrary start vertex, always adding the lightest edge that connects the tree to a new vertex.