The field of computational complexity and sorting algorithms is experiencing significant developments, with a focus on innovative techniques and models that advance our understanding of efficient computation. Researchers are exploring new paradigms for optimality, such as problem-dependent parameters and implicit measures, which are leading to the discovery of novel sorting algorithms and data structures. The study of suffixient sets, a novel combinatorial object, is also gaining traction as a tool for capturing repetitiveness in strings and supporting pattern matching. Furthermore, the introduction of partial computations in the red-blue pebble game is enabling more realistic cost models and pebbling strategies with smaller I/O costs. Noteworthy papers include: The paper on universally optimal sorting algorithms, which presents a novel measure of sortedness leading to an optimal algorithm based on partition sort. The paper on the impact of partial computations on the red-blue pebble game, which establishes the fundamental properties of this extended model and compares it to the original game.