What is the Big O time complexity of the worst case scenario for the following code designed to cube a double?

double cube$($double n$)\{$

return n $*$ n $*$ n;

$\}$