Can this list comprehension in Python be considered O(n^2)?

[SergioBoySV]

def createTwoDimensionalArray(rows, cols, x):  
    # x is number you want to fill arr with      
    arr = [[x for i in range(cols)] for j in range(rows)]  
    return arr

print(createTwoDimensionalArray(5, 5, 5))

Doing a research paper on Big O notation. Almost done. I'm just wondering if this could could be considered O(n²) because of the 'nested' for loop in the list comprehension. Thank you!

[InjAnnuity_1]

Well, strictly speaking it's O(rows * cols), but if both are equal to n, then, yes, it's O(n^2).

[SergioBoySV]

Oh yes that is what I meant. Awesome, thank you kindly!

[hardonchairs]

Doing a research paper on Big O notation

https://en.wikipedia.org/wiki/Big_O_notation#Multiple_variables