I am looking at the LAPACK DPOSV routine that computes the solution to the real system of linear equations A * X = B. The routine description can be found here:
http://www.math.utah.edu/software/lapack/lapack-d/dposv.html
How many floating point operations (flops) would a call to this routine take? What is the algorithmic complexity of this subroutine call?