I’m guessing that what’s being looked at here moreso is the space complexity of these algorithms. Heap sort and insertion sort I believe have the lowest of these, but insertion sort is also known to not be the best with time complexity. Therefore heap sort should take the cake
The answer is all of the above
Answer:
D. 41
Explanation:
101001 is in base 2.
To convert 101001 to base 10;
1*2^5+0*2^4+1*2^3+0*2^2+0*2^1+1*2^0
1*32+0*16+1*8+0*4+0*2+1*1
32+0+8+0+0+1
=41
Answer:
C. Recover the user data.
Explanation:
Because a virus delete user data
K- 1 x 2 =2
OH- 1 x 2 = 2
Cu- 2
(CIO3)- 6
K- 1 x 2= 2
OH- 2
Cu- 2
(CIO3)- 3 x2=6
2KOH+ Cu(CIO3)2 - 2KCIO3+ Cu(OH)2
