'QuickSort running time - by diffrent pivot chosen way

I need to sort an array Call A, that sort by a new Algorithm that calls new_QucikSort, that's the same Algorithm as quicksort instead of the fact that the pivot chosen by a new function that calls FINDPIVOT that running of O(N^1.1) complexity time, what's the worst time complexity of the new quicksort?

data-structures quicksort

Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution	Source

'QuickSort running time - by diffrent pivot chosen way

Sources

Related Questions