If for any $x, y\in A$ a $C^*$-algebra, $0\leq x\leq y\implies x^2\leq y^2$, then it is true that A is commutative ?
It is easy to show that the implication $0\leq x\leq y\implies x^2\leq y^2$ is not true in general, for example in $\mathcal{M}_2(\mathbb{R}) $ take for $x$ \begin{bmatrix}1&1\\1&1\end{bmatrix} and for $y$ \begin{bmatrix}2&1\\1&1\end{bmatrix} Moreover if $A$ is commutative then $y^2-x^2=(y-x)(y+x)$ is a product of two positive elements that commute with each other, thus $y^2-x^2\geq 0$. Indeed, if $a, b\in A^+$ and $ab=ba$ then $(ab)^*=ab$ and $\sigma (ab)=\sigma (a^{1/2}ba^{1/2})\subset [0, \infty [$.
Indeed this is known as Ogasawara's theorem, as you pointed out. I like to think of this in terms of representation theory, though this might be total overkill. Basically, I can prove the result in three steps:
I find that most results relating some order-theoretic property of a $C^*$-algebra with its commutativity can be proven this way. (For instance, a similar approach can be used to prove Sherman's theorem: the set $A^{\text{sa}}$ of self-adjoint elements of a $C^*$-algebra $A$ is a lattice if and only if $A$ is commutative.) It may not be the easiest proof of Ogasawara's theorem, but at least it doesn't really require any deep insight or clever trick, as it relies on the familiar theorems.
Now let's get into step 2 of the solution. There might well be an easier way to do this (perhaps even constructively), but here's what I've come up with. We shall use Kaplansky's density theorem as well as the following theorem used in the proof of said theorem:
This has the following very useful consequence:
The version of Kaplansky's density theorem that we need is the following:
Finally, we need the following easy lemmas, which I will not prove.
Now we are ready to prove the result. Suppose that $A \subseteq B(H)$ is a strongly dense $C^*$-subalgebra of $B(H)$, where $\dim(H) > 1$ holds. By part 1 of the general solution, there are self-adjoint $x,y\in B(H)$ satisfying $0 \leq x \leq y$ and $x^2 \not\leq y^2$. By theorem 3, there exist norm-bounded nets $\{a_\lambda\}_{\lambda\in\Lambda}$ and $\{b_\mu\}_{\mu\in M}$ consisting of positive elements in $A$ that converge strongly to $x$ and $y$, respectively. Without loss of generality, we may assume that these nets are indexed by the same directed set $D$ (take, if necessary, the direct product of $\Lambda$ and $M$). The net $\{a_\lambda - b_\lambda\}_{\lambda\in D}$ is norm-bounded as well, so by corollary 2 we have $$ \lim_{\lambda\in D} a_\lambda \curlyvee b_\lambda = \lim_{\lambda\in D} \tfrac{1}{2}(a_\lambda + b_\lambda + |a_\lambda - b_\lambda|) = \tfrac{1}{2}(x + y + |x - y|) = x\curlyvee y = y. $$ For convenience, write $c_\lambda = a_\lambda \curlyvee b_\lambda$. The point of this is that we have $0 \leq a_\lambda \leq c_\lambda$ for all $\lambda\in D$. This way we can approximate $x$ and $y$ using two norm-bounded nets $\{a_\lambda\}_{\lambda\in D}$ and $\{c_\lambda\}_{\lambda\in D}$ such that $0 \leq a_\lambda \leq c_\lambda$ holds for all $\lambda\in\Lambda$. Using corollary 2 once more, we find $$ \lim_{\lambda\in D} c_\lambda^2 - a_\lambda^2 = y^2 - x^2 \notin B(H)^+. $$ Since $B(H)^+$ is strongly closed, there must be at least one $\lambda\in D$ such that $c_\lambda^2 - a_\lambda^2 \not\geq 0$ holds, which proves the claim.