Prove, from first principles, that there is an algorithm that can determine whether any real symmetric matrix $A \in \mathbb{R}^{n \times n}$ is positive definite or not, with the computational cost (number of arithmetic operations) bounded by $\mathcal{O}\left(n^{3}\right)$.

[Hint: Consider the LDL decomposition.]