Suppose I got a Sort Algorithm with n² Time. Now I should find any four functions which has less growing in function , but not polynomial less.
What is the approach to ge
