Question

You have an array of n elements. Suppose you implement a quick sort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is

Answer 1

Hii

you are welcome in my ans

In array two type by which shorting is done

Bubble short

linear search

linear search :- it goes line by line and slow.

Bubble search :- it is fast and search by taking central element and from there it search .

_/\_☺️✌️✊

Hope it may helps you