please answer all these question What is the time complexity of the following code

Choose the correct time the complexity of the following code;

$(a)O(n^{**}n)(b)O(logn)$

$(c)O(nlogn)(d)O(n^{2}logn)34,8,64,51,32,21A=\{1,5,4,2,3\}$ int $1,j,k=0$

for $(1-\frac{n}{2}),1$

For the following numbers, what will the array elements look like after the second pas$in$ insertion sort?

Choose the correct option.

$(a)O(n^{**}n)(b)O(logn)$

$(c)O(nlogn)(d)O(n^{2}logn)$

$34,8,64,51,32,21$

How many inversions are there $in$ the array $A=\{1,5,4,2,3\}$ using based $on$ the counting inversion

problem $in$ ascending order?

Answer:

Two $of$ the most common divide$-$and$-$conquer sorting algorithms are quicksort and mergesort. $In$ practice,

quicksort $is$ often used for sorting data $in$ main storage rather than mergesort. Give a reason why quicksort

$is$ likely $tobe$ the preferred sorting algorithm for this application.