Published by Tsinghua University Press, 2024
ISBN 10: 7302640750 ISBN 13: 9787302640752
Language: English
Seller: liu xing, Nanjing, JS, China
£ 66.16
Convert currencyQuantity: 1 available
Add to basketpaperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2024-01 Pages: 300 Publisher: Tsinghua University Press This book is the online programming experiment guide for Algorithm Design and Analysis (3rd Edition · Micro-class Video · Question Bank Edition) (Li Chunbao et al. Tsinghua University Press. hereinafter referred to as Tutorial). which selects 186 online programming questions on LeetCode. LintCode. POJ and HDU platforms. and gives in-depth analysis and answers. These questions cover k.
Published by Tsinghua University Press, 2024
ISBN 10: 730264084X ISBN 13: 9787302640844
Language: English
Seller: liu xing, Nanjing, JS, China
£ 69.06
Convert currencyQuantity: 1 available
Add to basketpaperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2024-01 Pages: 292 Publisher: Tsinghua University Press This book is a companion study guide for Algorithm Design and Analysis (3rd Edition · Micro-class Video · Question Bank Edition) (Edited by Li Chunbao et al. Tsinghua University Press. hereinafter referred to as Tutorial). The book summarizes the knowledge structure of each chapter. analyzes the problem-solving process of 168 exercises in the Tutorial. and supplements 165 multiple-ch.
Published by Tsinghua University Press, 2022
ISBN 10: 7302594392 ISBN 13: 9787302594390
Language: English
Seller: liu xing, Nanjing, JS, China
£ 70.44
Convert currencyQuantity: 1 available
Add to basketpaperback. Condition: New. Paperback. Pub Date: 2022-02-01 Publisher: Tsinghua University Press This book combines classic problems with algorithm design techniques. and systematically introduces algorithm design techniques in a way that is easy for readers to understand and accept. including simulation method. recursion method . brute force. divide and conquer. reduce and conquer. greedy. dynamic programming. depth-first search. breadth-first search. backtracking. A* algorithm. bounded pruning. approximate algorithm. .
ISBN 10: 7302274134 ISBN 13: 9787302274131
Language: English
Seller: liu xing, Nanjing, JS, China
£ 50.22
Convert currencyQuantity: 1 available
Add to basketpaperback. Condition: New. Paperback. College planning materials computer science and technology algorithm analysis and design of the 21st century: Collegiate Programming Contest. for example. introduces the classic algorithm design techniques. including data structures and the Standard Template Library STL. recursive and divide and conquer strategies. dynamic programming. greedy algorithms. backtracking algorithm. branch and bound algorithm and graph search algorithms. College planning materials. computer science and .
Published by Tsinghua University Press, 2016
ISBN 10: 7302424500 ISBN 13: 9787302424505
Language: Chinese
Seller: liu xing, Nanjing, JS, China
£ 54.91
Convert currencyQuantity: 5 available
Add to basketpaperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2016-02-01 Publisher: Tsinghua University Press book mainly on the design and analysis of algorithms.
Seller: liu xing, Nanjing, JS, China
£ 67.58
Convert currencyQuantity: 5 available
Add to basketpaperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2018-07-01 Pages: 444 Publisher: Tsinghua University Press This book systematically introduces various commonly used algorithm design strategies. including recursion. divide and conquer. brute force. backtracking. and branching Law. greedy method. dynamic programming. probability algorithm and approximation algorithm. and discussed various graph algorithms and computational geometry design algorithms in detail. The book focuses on the original.
Published by Tsinghua University Press, 2022
ISBN 10: 7302594392 ISBN 13: 9787302594390
Language: Chinese
Seller: liu xing, Nanjing, JS, China
£ 70.44
Convert currencyQuantity: 3 available
Add to basketpaperback. Condition: New. Paperback. Pub Date: 2022-02-01 Publisher: Tsinghua University Press This book combines classic problems with algorithm design techniques. and systematically introduces algorithm design techniques in a way that is easy for readers to understand and accept. including simulation method. recursion method . brute force. divide and conquer. reduce and conquer. greedy. dynamic programming. depth-first search. breadth-first search. backtracking. A* algorithm. bounded pruning. approximate algorithm. .