QuickSort algorithm (Java)

Description

Implement the QuickSort algorithm (Java) that uses the “median of three” method to choose the pivot. The algorithm should sort an array of integers in ascending order. To determine the pivot, select the middle element, the first element, and the last element of the array, and use the median of these three values as the pivot. Ensure that the algorithm performs the partitioning and sorting correctly, and test your implementation with an array of integers.

Constraints:

• The array should consist of integers.
• You may assume that the input array has at least one element.

Example: For the input array [9, 3, 7, 2, 5, 8, 1, 6, 4], the QuickSort algorithm should return the sorted array [1, 2, 3, 4, 5, 6, 7, 8, 9].