Please correct me if i am wrong COMPLEXITY OF THE CODE SHOULD BE-->t(n+26+q(m))==t(n+n^2)==n^3 if t,q,m ,n are of same constraint oreder

#1
#2

@kailash_01 yes time complexity will be n cube if they are of same constraint.(o(tqm)=o(t^3)=o(m^3)=o(q^3)=o(n^3)
Hope this resolved your doubt.
Remember to mark it as resolved in my doubts
section :smiley:

#3

please sove my doubt in line no 42 i am printing the b[i] from i=0;i=m shul it consider in complexity as i study input and output is not consider in the complexity ???/

#4

Yes it will be considered.
input output is not considered if they are being done constant number of times.
but in line 42 you are outputting m times so that for loop takes o(m)