Problem
Hierarchy between n, nlogn, nlogkn and n2.
There are direct sorting algorithms whose complexity is of order n2. By means of the divide and conquer technique, ordering algorithms with complexity of nlogn order are achieved.
Task
1. Determine in detail where nlogn is located, between n and n2.
2. Determine where nlogkn is located.
3. Express the two previous results with simple words.