0 0 votes Which of the following is the every-case time complexity of dynamic programming algorithm for "traversing salesperson" problem to traverse ' $n$ ' cities?$\Theta\left(\log n 2^{n}\right)$$\Theta\left(n 2^{n}\right)$$\Theta\left(2^{n}\right)$$\Theta\left(n^{2} 2^{n}\right)$ Others cil-2017 + – Shubham Sharma 2 31 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.