Question

insider the following C+ oode fragment
ink count = 0;

int in sizeof(a) / sizeof(int):
sort(a, and
for lint i = 0; i<n; i++)
for(int) = 1+1, 21++)
if pilgry-searcia, stnkt at])) countt
Here, a is an array of hype NL Suppose narit takes 1 cond when n = 3,500
Approximately how long lake when n = 35,000? Justin your answer
Consider the following code frage which campures the maudif function for an amay
m value of the difference​

Answer 1

Explanation:

juauiaiquwykekdiduehrmrkdiidhxjcjcjxiuxyxgsgbebehdhhdgxgxgheheysyxtdtyayauuzuzuzuuzuxuzuuzuzuususususuusuusuwu juauaiuaisiusisiaisiisusi siiauusis73ja7wiisuske8aj hsisu6at