Sedgewick introduced a version of Quicksort that partition's its elements into 3 sections rather than 2, following an idea suggested by E. Dijkstra. What is the main reason to use the 3-way Quicksort

3-way quicksorth is used

If the array includes many duplicates

Explanation:

In simple QuickSort algorithm, we select an element as pivot, partition the array around pivot and recur for subarrays on left and right of pivot.

Consider an array which has many redundant elements. For example, {1, 4, 2, 4, 2, 4, 1, 2, 4, 1, 2, 2, 2, 2, 4, 1, 4, 4, 4}. If 4 is picked as pivot in Simple QuickSort, we fix only one 4 and recursively process remaining occurrences.

hello, how (you)? not bad. luisa. i'm jose luis. a lot. is that her? tania is from. select the sentence that does not belong. chau. good bye. see you later. hello, how are you? my name is victor. i'm carmen. what's your name? i am sorry. fine you. and you? nice to meet you. the taste is mine. delighted. complete the mini-dialogues with the appropriate words. "are they? " — they're from. where, nights where, spain call, united states where, delighted — good morning. i