Question: 8. What will be the auxiliary space 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> <span class="kw4">void</span> convert<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> temp<span class="br0">[</span>n<span class="br0">]</span><span class="sy0">;</span> <span class="kw3">memcpy</span><span class="br0">(</span>temp<span class="sy0">,</span> arr<span class="sy0">,</span> n<span class="sy0">*</span><span class="kw4">sizeof</span><span class="br0">(</span><span class="kw4">int</span><span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span> sort<span class="br0">(</span>temp<span class="sy0">,</span> temp <span class="sy0">+</span> n<span class="br0">)</span><span class="sy0">;</span> unordered_map<span class="sy0">&lt;</span><span class="kw4">int</span><span class="sy0">,</span> int<span class="sy0">&gt;</span> map<span class="sy0">;</span> <span class="kw4">int</span> sort_index <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> <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> map<span class="br0">[</span>temp<span class="br0">[</span>i<span class="br0">]</span><span class="br0">]</span> <span class="sy0">=</span> sort_index<span class="sy0">++;</span> <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> arr<span class="br0">[</span>i<span class="br0">]</span> <span class="sy0">=</span> map<span class="br0">[</span>arr<span class="br0">[</span>i<span class="br0">]</span><span class="br0">]</span><span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">void</span> printArr<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="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> arr<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> <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">10</span><span class="sy0">,</span> <span class="nu0">20</span><span class="sy0">,</span> <span class="nu0">15</span><span class="sy0">,</span> <span class="nu0">12</span><span class="sy0">,</span> <span class="nu0">11</span><span class="sy0">,</span> <span class="nu0">50</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> convert<span class="br0">(</span>arr <span class="sy0">,</span> n<span class="br0">)</span><span class="sy0">;</span> printArr<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(n)
O(1)
O(log n)
O(n log n)
Answer: A