Time complexity of nested loops where k < j < i < n
<p>I would like to know the time complexity of this algorithm and how it is calculated. </p>

<pre><code>for (i = 1; i &lt; 2n; i++) {
    for (j = 1; j &lt; i; j++) {
        for (k = 1; k &lt; j; k++) {
            // do something
        }
    }
}
</code></pre>