Question: 10. What will be the worst case time complexity of the following code?<div class="hk1_style-wrap4"><div class="hk1_style-wrap3"><div class="hk1_style-wrap2"><div class="hk1_style-wrap"><div class="hk1_style"><div class="c"><pre class="de1"><span class="co2">#include &lt;bits/stdc++.h&gt; </span> using namespace std<span class="sy0">;</span> &nbsp; <span class="kw4">void</span> func<span class="br0">(</span><span class="kw4">int</span> arr<span class="br0">[</span><span class="br0">]</span><span class="sy0">,</span> <span class="kw4">int</span> n<span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> count<span class="br0">[</span>n<span class="br0">]</span><span class="sy0">;</span> <span class="kw3">memset</span><span class="br0">(</span>count<span class="sy0">,</span> <span class="nu0">0</span><span class="sy0">,</span> <span class="kw4">sizeof</span><span class="br0">(</span>count<span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span> &nbsp; <span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">=</span>n<span class="sy0">-</span><span class="nu0">2</span><span class="sy0">;</span> i<span class="sy0">&gt;=</span><span class="nu0">0</span><span class="sy0">;</span> i<span class="sy0">--</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw1">if</span> <span class="br0">(</span>arr<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">&gt;=</span> n <span class="sy0">-</span> i <span class="sy0">-</span> <span class="nu0">1</span><span class="br0">)</span> count<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">++;</span> &nbsp; <span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> j<span class="sy0">=</span>i<span class="sy0">+</span><span class="nu0">1</span><span class="sy0">;</span> j <span class="sy0">&lt;</span> n<span class="sy0">-</span><span class="nu0">1</span> <span class="sy0">&amp;&amp;</span> j <span class="sy0">&lt;=</span> arr<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">+</span> i<span class="sy0">;</span> j<span class="sy0">++</span><span class="br0">)</span> &nbsp; <span class="kw1">if</span> <span class="br0">(</span>count<span class="br0">[</span>j<span class="br0">]</span> <span class="sy0">!=</span> <span class="sy0">-</span><span class="nu0">1</span><span class="br0">)</span> count<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">+=</span> count<span class="br0">[</span>j<span class="br0">]</span><span class="sy0">;</span> &nbsp; <span class="kw1">if</span> <span class="br0">(</span>count<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">==</span> <span class="nu0">0</span><span class="br0">)</span> count<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">=</span> <span class="sy0">-</span><span class="nu0">1</span><span class="sy0">;</span> <span class="br0">}</span> &nbsp; <span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">=</span><span class="nu0">0</span><span class="sy0">;</span> i<span class="sy0">&lt;</span>n<span class="sy0">;</span> i<span class="sy0">++</span><span class="br0">)</span> cout <span class="sy0">&lt;&lt;</span> count<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">&lt;&lt;</span> <span class="st0">" "</span><span class="sy0">;</span> <span class="br0">}</span> &nbsp; &nbsp; <span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> arr<span class="br0">[</span><span class="br0">]</span> <span class="sy0">=</span> <span class="br0">{</span><span class="nu0">1</span><span class="sy0">,</span> <span class="nu0">3</span><span class="sy0">,</span> <span class="nu0">5</span><span class="sy0">,</span> <span class="nu0">8</span><span class="sy0">,</span> <span class="nu0">9</span><span class="br0">}</span><span class="sy0">;</span> <span class="kw4">int</span> n <span class="sy0">=</span> <span class="kw4">sizeof</span><span class="br0">(</span>arr<span class="br0">)</span> <span class="sy0">/</span> <span class="kw4">sizeof</span><span class="br0">(</span>arr<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span><span class="br0">)</span><span class="sy0">;</span> func<span class="br0">(</span>arr<span class="sy0">,</span> n<span class="br0">)</span><span class="sy0">;</span> <span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="br0">}</span></pre></div></div></div></div></div></div>
Options:
O(n1/2)
O(n)
O(n3/2)
O(n2)
Answer: C