context: If the input size is n, the time taken can be expressed as a function of n. Since the time taken on different inputs of the same size can be different, the worst-case time complexity T(n) is defined to be the maximum time taken over all inputs of size n. If T(n) is a polynomial in n, then the algorithm is said to be a polynomial time algorithm. Cobham's thesis says that a problem can be solved with a feasible amount of resources if it admits a polynomial time algorithm.
question: কিভাবে সবচেয়ে খারাপ সময় জটিলতা একটি অভিব্যক্তি হিসাবে লেখা হয়?
answers: T(n) T(n) T(n)