warriorprincess
return if (input[0] > input[pivot]) findSmallest(input.sliceArray(0..pivot)) else if (nums[pivot] > nums[nums.size-1]) findSmallest(input.sliceArray(pivot until input.size))