Time complexity T(n) for an algorithm that depends on 2 inputs

Question

Normally when analyzing the running time of an algorithm i am dealing with a single input that affects the running time. I\'m trying to understand how to represent T(n) when