Adaptive algorithms try to realize cost savings when an input is “easier” than a typical one (while retaining the same guarantees when it is not). The talk will present examples of adaptive sorting algorithms and their analysis, with a focus on methods of practical relevance for programming libraries: Quicksort and Powersort. It will further show examples of adaptive methods for other fundamental tasks such as selection and dynamic ordered dictionaries.