Design and Analysis of Algorithm

Providing an introduction to the field of algorithms, this textbook employs a comprehensive taxonomy of algorithm design techniques that is more powerful and intuitive than the traditional approach.

It begins with a discussion of algorithm performance, and provides comprehensive coverage of such topics as red-black tree, graph algorithms and binary search and sort algorithms-along with techniques for optimization.

Table of Contents

• Preface
• Algorithm and Performance Analysis
• Sorting and Order Statistics
• Sorting in Linear Time
• Data Structure and Tree
• Advanced Data Structures
• Advanced Design and Analysis Techniques
• Graph Algorithm
• Backtracking
• Branch and Bound Technique
• Network Flow
• Polynomials and the FFT
• String Matching
• NP Completeness
• Approximation Algorithm
• Index.

Anuj Bhardwaj.: Department of Computer Science and Engineering ARNI University, Kathgarh, Kangra Prarag Verma.: Department of Computer Science and Engineering Gyan Bharti Institute of Technology, Gyan Nagar, Partapur Bypass Meerut