Question

In quick sort, the number of partitions into which the file of size n is
divided by a selected record is
a. n
b. n - 1
c. 2
d. n/2

Answer 1

Answer:

I do t know what r u coming to to tell me or us...

Answer 2

In quick sort, the number of partitions into which the file of size n is divided by a selected record is - c. 2

• Quick sort , from its name itself we can say that it is a fast method to sort any lists of things. It means it is capable of sorting the data significantly faster than any other algorithm sorting.

• It is also called as Partition Exchange Sort as it is based on the splitting of an array (partition) into smaller ones .

• Here in the quick sort , the file of n size divided by a selected record have two partitions.