What is the time complexity of the algorithm in terms of nlogn?

The time complexity of the algorithm is O(n log n), which means the running time grows in proportion to n multiplied by the logarithm of n.