Analysis Of Algorithms

Design and analysis of algorithms is the process of finding the computational complexity of algorithms. It helps to design and analyze the logic on how the algorithm will work before developing the actual code for a program.It focuses on introduction to algorithm, asymptotic complexity, sorting and searching using divide and conquer,greedy method, dynamic programming, backtracking, branch and bound. NP-hard and NP-complete problems.The applications of algorithm design are used for information storage, retrieval, transportation through networks,and presentation to users.