I can't find the time complexity of the following program. Even I can't find a way to calculate its complexity with master theorem. Please help me about how to calculate it. Thanks
My submission : https://codeforces.me/contest/128/submission/114386842
Problem link : https://codeforces.me/contest/128/problem/B
When execute loop , Value of K decreasing And When K == 0 base case is true and function returns. So time complexity is O(klogn) for sorting
Thanks a ton. I got it.