The purpose of estimating algorithm time$-$complexity using the Big O notation is

to estimate the execution time of algorithms.

to estimate the growth function of the execution time of algorithms as the size of the data they operate on grows very large $.$

to measure the actual execution time of algorithms.