I want to express the asymptotic time complexity for the worst case scenario of sorting a list of $ n$ strings, each string of length $ k$ letters. Using merge-sort, sorting a list of $ n$ elements requires $ O(n\log n)$ . Comparing two strings of length $ k$ has a cost of $ O(k)$ . Therefore, the cost would be $ O(kn\log n)$ .
However, I know some restrictions about $ k$ and $ n$ due to the nature of the problem. In particular, I know that for any list, $ 0 \lt k \leq 20$ , and $ 0 \lt n \leq 80000$ . In other words, the number of words in a list might vary in a much larger range than the length of the words.
In that case, would it be correct to say that $ n$ dominates over $ k$ and therefore the cost could be expressed as $ O(n\log n)$ ? Or does the fact that we are discussing asymptotic costs make those restriction meaningless (as we are describing how the algorithm is impacted by the growth of each variable, regardless of how much they can actually grow)? In general, if two variables are independent, is it possible to dismiss one of them from the asymptotic cost under certain circumstances?