Quick sorting by sorting algorithm (JAVA)

[Java] public class QuickSort {/*** 1. First, retrieve a number from the series as the reference number. * 2. In the partitioning process, place all the numbers greater than this number to its right, and all the numbers smaller than or equal to it to its left. * 3. Repeat the second step for the left and right intervals until each interval has only one number. * The time complexity is O (nlog n) * unstable sorting method * @ param nums array to be sorted * @ return output ordered array */public static int [] sort (int [] nums, int low, int high) {if (low