The Grisu algorithm can quickly generate the shortest representation in most cases, but still has approximately 0.5% of difficult cases that require falling back to a slow path.