Observe that the while loop of lines 5–7 of the INSERTION-SORT procedure uses a linear search to scan (backward) through the sorted subarray A[1 · · · j]. Can we use a binary search instead to improve the overall worst-case running time of insertion sort to Θ(n log n)?

You click on it and type

Iposit c as the correct answerbeing a waitress and managing a restaurant can be different jobs in the same care  this is because the difference between the two is attitude. they can be both jobs or careers, if the attitude of the job-doer is that way. on e can be a manger yet sees it a s a job. the job of waitress can also have an impact on future job prospects thus is important for the career line.

A.is the answerhope it !