时间复杂度
Contents
<div id="highlighter_943776" class="syntaxhighlighter cpp">
<table border="0" cellspacing="0" cellpadding="0">
<tr>
<td class="gutter">
<div class="line number1 index0 alt2">
1
<div class="line number2 index1 alt1">
2
<div class="line number3 index2 alt2">
3
<div class="line number4 index3 alt1">
4
<div class="line number5 index4 alt2">
5
<div class="line number6 index5 alt1">
6
<div class="line number7 index6 alt2">
7
<div class="line number8 index7 alt1">
8
<div class="line number9 index8 alt2">
9
</td>
<td class="code">
<div class="container">
<div class="line number1 index0 alt2">
<code class="cpp keyword bold">for</code><code class="cpp plain">(i=1; i<=n; ++i)</code>
<div class="line number2 index1 alt1">
<code class="cpp plain">{</code>
<div class="line number3 index2 alt2">
<code class="cpp spaces"> </code><code class="cpp keyword bold">for</code><code class="cpp plain">(j=1; j<=n; ++j)</code>
<div class="line number4 index3 alt1">
<code class="cpp spaces"> </code><code class="cpp plain">{</code>
<div class="line number5 index4 alt2">
<code class="cpp spaces"> </code><code class="cpp plain">c[i][j] = 0;</code><code class="cpp comments">//该步骤属于基本操作执行次数:n的平方次</code>
<div class="line number6 index5 alt1">
<code class="cpp spaces"> </code><code class="cpp keyword bold">for</code><code class="cpp plain">(k=1; k<=n; ++k)</code>
<div class="line number7 index6 alt2">
<code class="cpp spaces"> </code><code class="cpp plain">c[i][j] += a[i][k] * b[k][j];</code><code class="cpp comments">//该步骤属于基本操作执行次数:n的三次方次</code>
<div class="line number8 index7 alt1">
<code class="cpp spaces"> </code><code class="cpp plain">}</code>
<div class="line number9 index8 alt2">
<code class="cpp plain">}</code>
</td>
</tr>
</table>
Author w1100n
LastMod 2015-06-28