Question

The quick sort algorithm uses a ________ to divide the array into two pieces.

Group of answer choices

divider

pivot

mid-point

key

Which of the following statement(s) are true about quick sort?

Group of answer choices

It does not require additional memory that merge sort does.

All of them

In practice, it can be faster than merge sort.

It can degrade into an O(n²) sort if the pivot-selection scheme is bad.

Which sort does not use comparisons?

Group of answer choices

radix sort

shell sort

quick sort

merge sort

In the ADT sorted list, what happens when the remove(anEntry) is called?

Group of answer choices

it returns true if it succeeded

All of them

it removes the given entry

it returns false if it failed

Answer 1

Answer 1
************
pivot

the quicksort algorithm divides the array into two parts, referred to as the low partition and the high partition.All values in the low partition are less than or equal to the pivot value.

Answer 2
************
It can degrade into an O(n2) sort if the pivot-selection scheme is bad.

Answer 3
**********
radix sort

No comparison sorting includes Counting sort which sorts using key-value, Radix sort

Answer 4
***********
All of them

if you have any doubt then please ask me without any hesitation in the comment section below , if you like my answer then please thumbs up for the answer , before giving thumbs down please discuss the question it may possible that we may understand the question different way and i can edit and change the answers if you argue, thanks :)