👉 In computational complexity theory, a super-restriction of an algorithm is a special case where the running time bound is replaced by a tighter bound. In other words, it's an extension that makes the worst-case run-time for the algorithm depend on fewer inputs. For example, consider the problem of finding the shortest path between two points in a graph. If we use the standard algorithm to find this path with constant space and constant time complexity, it will take O(|V|) time and O(
