Let's consider the set consisting of $8$ elements $\{\pm1, \pm i,\pm j, \pm k\}$ with the following multiplication table:
We see that $1$ commutes with any of the $\{i,j,k\}$.
For example, we want to consider the product $(-1)\cdot j$, since $i^2=-1$ then we can rewrite it as: $(-1)\cdot j=(i\cdot i)\cdot j=i\cdot(i\cdot j)=i\cdot k=-j$.
In this example and in many others in order to multiply elements we need to use associativity property. How to prove that associativity is true in this set?
In similar topic I have seen approach using automorphism. However, I was not able to comprehend it. Can anyone explain it please?
Would be grateful if somebody can demonstrate some elementary approach. In my opinion it is definitely important to know.

In short, you can check since there are finite elements. Probably an easier method is to identify elements of the group with their matrix representations and inherit the associativity of matrix multiplication from there.