Cyclomatic-complexity metrics
<p>I am wondering if using LOC and cyclomatic-complexity metrics can anyone draw any conclusions about the relative complexity of the two codes below? is kinda doing my head in.</p>

<p>Code A</p>

<pre><code> int i = 1;
    while(i &lt; = 5){

    playACard(i);

    if (playerHasWon(i))
    break;
    i++
    }
</code></pre>

<p>Code B</p>

<pre><code>int j = 0;

int i = 2;

j = i;
j = j + i;

j++;
System.out.println (j);

System.out.println
</code></pre>
