Hi all,\nI have a basic question in context of Big O.\nQ: Is it correct to  use min and max , in interview, to specify Big O?\ne,g is O(max(m, n) log(max(m, n)))  as mentioned [here](https://leetcode.com/problems/intersection-of-two-arrays-ii/discuss/82263/C%2B%2B-hash-table-solution-and-sort-%2B-two-pointers-solution-with-time-and-space-complexity) correct  or is m log m + n log n more correct?\nAsking because  in Big O chapter in CTCL we use  O(m log m + n log n) (example 8 , page 49 , Chapter VI)\n

Hi all,\nI have a basic question in context of Big O.\nQ: Is it correct to  use min and max , in interview, to specify Big O?\ne,g is O(max(m, n) log(max(m, n))