The time complexity is going to be O(nlogn)
The inner loop is running for only O(n) times, and once the value of i become n+1 it fails the condition and the inner loop will halt and will not going to run again. Now when it comes to the termination of the outer loop , it will terminate when the condition i<=nlogn become false, which will happen only when i=nlogn+1, and the will happen after nlogn steps.