Navigation is a critical function in real-world complex networks, and the structural properties of these networks often reflect this significance. Greedy navigation is a widely accepted modeling framework for understanding navigation in such networks. In this paper, we investigate the information content of the forwarding patterns in greedy navigation using information-theoretical methods. Our findings show that the orderliness of these forwarding patterns is significantly higher than that of shortest-path routing, leading to a substantial reduction in the memory required to implement greedy navigation.