### My issue

What is the time complexity of the 2 algorithms (both are called with argument `n`

)?

TC of myFunc1 is O(n^2)

TC of myFunc1 is O(n^3)

TC of myFunc1 is O((n^2)*log(n))

TC of myFunc2 is O(nlog(n))

TC of myFunc2 is O(n^2)

TC of myFunc2 is O(n)

Learning course: DSA using Java

Problem Link: CodeChef: Practical coding for everyone