Question: 6. What is the time complexity of the following iterative implementation used to find the largest and smallest element in an array?<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;stdio.h&gt;</span> <span class="kw4">int</span> get_max_element<span class="br0">(</span><span class="kw4">int</span> <span class="sy0">*</span>arr<span class="sy0">,</span><span class="kw4">int</span> n<span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> i<span class="sy0">,</span> max_element <span class="sy0">=</span> arr<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span><span class="sy0">;</span> <span class="kw1">for</span><span class="br0">(</span>i <span class="sy0">=</span> <span class="nu0">1</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> <span class="kw1">if</span><span class="br0">(</span>arr<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">&gt;</span> max_element<span class="br0">)</span> max_element <span class="sy0">=</span> arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">;</span> <span class="kw1">return</span> max_element<span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">int</span> get_min_element<span class="br0">(</span><span class="kw4">int</span> <span class="sy0">*</span>arr<span class="sy0">,</span> <span class="kw4">int</span> n<span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> i<span class="sy0">,</span> min_element<span class="sy0">;</span> <span class="kw1">for</span><span class="br0">(</span>i <span class="sy0">=</span> <span class="nu0">1</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> <span class="kw1">if</span><span class="br0">(</span>arr<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">&lt;</span> min_element<span class="br0">)</span> min_element <span class="sy0">=</span> arr<span class="br0">[</span>i<span class="br0">]</span><span class="sy0">;</span> <span class="kw1">return</span> min_element<span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> n <span class="sy0">=</span> <span class="nu0">7</span><span class="sy0">,</span> arr<span class="br0">[</span><span class="nu0">7</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">1</span><span class="sy0">,</span><span class="nu0">1</span><span class="sy0">,</span><span class="nu0">0</span><span class="sy0">,-</span><span class="nu0">1</span><span class="sy0">,-</span><span class="nu0">1</span><span class="sy0">,-</span><span class="nu0">1</span><span class="br0">}</span><span class="sy0">;</span> <span class="kw4">int</span> max_element <span class="sy0">=</span> get_max_element<span class="br0">(</span>arr<span class="sy0">,</span>n<span class="br0">)</span><span class="sy0">;</span> <span class="kw4">int</span> min_element <span class="sy0">=</span> get_min_element<span class="br0">(</span>arr<span class="sy0">,</span>n<span class="br0">)</span><span class="sy0">;</span> <span class="kw3">printf</span><span class="br0">(</span><span class="st0">"%d %d"</span><span class="sy0">,</span>max_element<span class="sy0">,</span>min_element<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(1)
O(n)
O(n2)
O(n/2)
Answer: B