Give lecture on - Brute Force, Greedy method, branch and bound, backtracking , dynamic programming , asymptotic analysis (best,worst,average cases), of time and space , upper and lower bound, basic concept of complexity classes- P, NP,Np-hard,NP-complete, graph and tree algorithm , depth breadth first traversal , tractable and interactable problem
6ncube = theta(n squre) 2 power n+1 = big oh ( n square) 2 power n = big oh ( 2 power n) n sqare not belong small oh ( n square) 100 . n not belong omega n square can anyone help me in this questions please