Your cart is empty now.
Dimensions:
176 mm × 250 mm
17.6 cm × 25 cm
6.93 inches × 9.84 inches
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.
Contrary to popular belief, Lorem Ipsum is not simply random text.
Contrary to popular belief, Lorem Ipsum is not simply random text.