Question

Implement quick sort algorithm for an array of n integers where the pivot is the middle element from the array. If n is even then the pivot element is the (n/2)th element and if nis odd then the pivot element is the ((n+1)/2)th element of the array. The output must display the pivot element at the beginning and the sorted list in ascending order.

Input

8

80 70 60 50 40 30 20 10

Output

50

10 20 30 40 50 60 70 80​

Answer 1

Answer:

yeah I can tell u about this answer but first open ur book