For an algorithm and associated problem, the determination of an upper bound on the number of steps that the algorithm can take on any instance of the problem. For an optimization problem and an associated heuristic or nonoptimal algorithm, worst-case analysis may include a statement of how far the objective value returned by the algorithm will be from the true optimal solution.