Vendor Profile
Shoeisha Co., Ltd.
| Address | 5 Funamachi Shinjuku-ku Tokyo, JAPAN ZIP:160-0006 |
|---|---|
| Representative Name | Kaoru Usui |
| Annual Revenue | closed |
| No. of Employees | 185 |
| Web Site URL |
SD item code:13485838
| Detail | Price & Quantity | ||
|---|---|---|---|
| S1 |
Aditya Y. Bhargava Originally authored by
Supervised by Queep Co.
Translated by Queep Co.
 Original text before translation
Aditya Y. Bhargava 原著
株式会社クイープ 監修
株式会社クイープ 翻訳
(186890)
JAN:9784798186890
|
(186890)
JAN:9784798186890
Wholesale Price: Members Only
1 pc /set
In Stock
|
|
| Shipping Date |
|---|
|
About 1 week
|
| Dimensions |
|---|
|
Format:B5
Number of pages: 352 |
| Specifications |
|---|
|
Country of manufacture: Japan
Material / component: Format:Book (paper)
Year of manufacture: 2025
Product tag: None
|
Description
| Finding people, bus connections, shopping: ...... Familiar algorithms in a radius of 3 meters are so easy to understand! Second edition with expanded explanation of the "tree structure" used behind various algorithms! Knowledge of algorithms is essential for programming. However, when you start learning algorithms, you often get lost between the mountains of logic and the valleys of mathematical formulas. This book is recommended for such situations. This book explains algorithms in simple terms with the help of illustrations and sample programs, using familiar examples such as finding a person or transferring on a bus. To read the book, you only need to know basic algebra at the middle school level. If you know one of the programming languages, you will understand more deeply. If you read to the end, you will have a solid understanding of a number of important algorithms with a wide range of applications. [This book is the Japanese translation of "Grokking Algorithms, Second Edition."] [Table of Contents]. *Chapter 1: Algorithms for This and That *Chapter 2: Sorting, Inserting, and Selecting: Sorting *Chapter 3. Same Steps Over and Over: Recursion *Chapter 4: Think Tiny, Then Think Quick: Quick Sort *Chapter 5: Quicker by association: hash tables *Chapter 6: Make a graph and you'll see: breadth-first search *Chapter 7: Trace and find: Tree structure *Chapter 8 Don't wobble: Equilibrium trees *Chapter 9 Bartering from a book to a piano: Dijkstra method *Chapter 10 The problem goes on and on: The greed method *Chapter 11 Drobo is planned: Dynamic programming method *Chapter 12 Predict after classification: k-nearest neighbor method *Chapter 13 What's next? *Appendix A AVL Tree Performance *Appendix B NP-hard problems *Appendix C Answers |
More
| Shipping Method | Estimated Arrival |
|---|---|
| Sea Mail | From Nov.24th 2025 to Jan.26th 2026 |
| Air Mail | From Nov.6th 2025 to Nov.10th 2025 |
| EMS | From Nov.5th 2025 to Nov.10th 2025 |
| Pantos Express | From Nov.7th 2025 to Nov.12th 2025 |
| DHL | From Nov.5th 2025 to Nov.7th 2025 |
| UPS | From Nov.5th 2025 to Nov.7th 2025 |
| FedEx | From Nov.5th 2025 to Nov.7th 2025 |
|
Some trading conditions may be applicable only in Japan.
This product (book) is subject to the Resale Price Maintenance Program. The law allows the manufacturer (publisher) to specify the sales price. We ask that your company also adhere to the resale price specified by us. In the unlikely event that you fail to do so, we may terminate the transaction. Thank you very much for your understanding and cooperation.
|
Other items from this category:
Familiar algorithms in a radius of 3 meters are so easy to understand!
Second edition with expanded explanation of the "tree structure" used behind various algorithms!
Knowledge of algorithms is essential for programming. However, when you start learning algorithms, you often get lost between the mountains of logic and the valleys of mathematical formulas.
This book is recommended for such situations. This book explains algorithms in simple terms with the help of illustrations and sample programs, using familiar examples such as finding a person or transferring on a bus.
To read the book, you only need to know basic algebra at the middle school level. If you know one of the programming languages, you will understand more deeply.
If you read to the end, you will have a solid understanding of a number of important algorithms with a wide range of applications.
[This book is the Japanese translation of "Grokking Algorithms, Second Edition."]
[Table of Contents].
*Chapter 1: Algorithms for This and That
*Chapter 2: Sorting, Inserting, and Selecting: Sorting
*Chapter 3. Same Steps Over and Over: Recursion
*Chapter 4: Think Tiny, Then Think Quick: Quick Sort
*Chapter 5: Quicker by association: hash tables
*Chapter 6: Make a graph and you'll see: breadth-first search
*Chapter 7: Trace and find: Tree structure
*Chapter 8 Don't wobble: Equilibrium trees
*Chapter 9 Bartering from a book to a piano: Dijkstra method
*Chapter 10 The problem goes on and on: The greed method
*Chapter 11 Drobo is planned: Dynamic programming method
*Chapter 12 Predict after classification: k-nearest neighbor method
*Chapter 13 What's next?
*Appendix A AVL Tree Performance
*Appendix B NP-hard problems
*Appendix C Answers