асимптотика

There is a dynamic programming algorithm where you need to find the largest decreasing subsequence. The algorithm in this cas ... to n, then it is clear that the execution time is n2 (n is the square), but in the above case, it turns out that? n log(n) ?

You see, the asymptotics of this function are very important to me.