Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)
The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.
1147934874
Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)
The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.
39.95 In Stock
Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)

Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)

Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)

Mastering Algorithms: A systematic approach to data structures and problem-solving techniques (English Edition)

Paperback

$39.95 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.

Product Details

ISBN-13: 9789365899603
Publisher: Bpb Publications
Publication date: 07/31/2025
Pages: 480
Product dimensions: 7.50(w) x 9.25(h) x 0.97(d)

About the Author

Prof. (Dr.) Rahul Bhandari is a senior IEEE member. He is an accomplished academic and researcher in computer science and engineering with over a decade of experience. Currently a professor at Chandigarh University, Punjab
From the B&N Reads Blog

Customer Reviews