Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Quick sort

Select possible orders of elements after partition

Report a typo

Someone uses quicksort to sort an array of ints in the ascending order.

Suppose we do not know the original order in the array and the partition strategy.

Select all possible orders of elements after the partition operation if the pivot was 56.

Select one or more options from the list

50, 47, 45, 35, 32, 56, 61, 62, 78, 91

32, 35, 46, 47, 50, 56, 61, 62, 78, 91

32, 35, 46, 56, 47, 50, 61, 62, 78, 91

35, 32, 46, 47, 50, 56, 62, 61, 91, 78

32, 62, 46, 91, 50, 56, 61, 35, 78, 47

___

Create a free account to access the full topic