“When a sorting algorithm encounters a "broken" digit that cannot be moved, it demonstrates a form of delayed gratification by temporarily decreasing the overall sortedness of the array to work around the obstacle and achieve its final goal.”