• µµ¼­ºÐ·ù
• µµ¼­¼Ò°³
• ¸ñÂ÷
• °ü·Ãµµ¼­
ÇöÀçÀ§Ä¡
Home > »óÇ°Á¤º¸
[¿Ü¼­ÇåÃ¥] E=Computer Algorithms C++ (Hardcover) [Àç°í: 1 ±Ç]
Ellis Horowitz ÁöÀ½ | W.H. Freeman & Company Æ쳿
 

¤ýÆǸŰ¡ 70,000 ¿ø (0%, 0 ¿ø ÇÒÀÎ)
¤ýÀû¸³±Ý 0 ¿ø (0% Àû¸³)
¤ýÃâ°£ÀÏ : 1996 ³â 12 ¿ù 15 ÀÏ
¤ý769 pages ÂÊ | B5 »ç·ú¹èÆÇ (257x182mm) | ISBN : 9780716783152
¤ý1¸¸¿ø ÀÌ»ó ÁÖ¹®½Ã ¹«·á¹è¼Û
¤ýµµ¼­»óÅ : ÇåÃ¥(»óžçÈ£)
Ãßõ¸ÞÀÏ µ¶ÀÚ¼­Æò¾²±â
ÃÑ·ù ¡æ ÃÑ·ù ¡æ ÄÄÇ»ÅÍÇÁ·Î±×·¥
¡Ø µµ¼­ÀÇ »ó¼¼ÇÑ ³»¿ëÀº ¾Æ¸¶Á¸¿¡¼­ È®ÀÎÇÏ½Ç ¼ö ÀÖ½À´Ï´Ù. [ ³»¿ëº¸±â]

-ÀÌ µµ¼­´Â Á¤°¡°¡ ¾ø¾î ÀÓÀÇ·Î ±â·ÏÇÕ´Ï´Ù.

THE AUTHOR TEAM THAT ESTABLISHED ITS REPUTATION NEARLY TWENTY YEARS AGO WITH "FUNDAMENTALS OF COMPUTER ALGORITHMS" OFFERS THIS NEW TITLE, AVAILABLE IN BOTH PSEUDOCODE AND C++ VERSIONS. IDEAL FOR JUNIOR/SENIOR LEVEL COURSES IN THE ANALYSIS OF ALGORITHMS, THIS WELL-RESEARCHED TEXT TAKES A THEORETICAL APPROACH TO THE SUBJECT, CREATING A BASIS FOR MORE IN-DEPTH STUDY AND PROVIDING OPPORTUNITIES FOR HANDS-ON LEARNING. EMPHASIZING DESIGN TECHNIQUE, THE TEXT USES EXCITING, STATE-OF-THE-ART EXAMPLES TO ILLUSTRATE DESIGN STRATEGIES.

Preface
1 Introduction 1 
2 Elementary Data Structures 65 
3 Divide-and-Conquer 127 
4 The Greedy Method 195 
5 Dynamic Programming 253 
6 Basic Traversal and Search Techniques 313 
7 Backtracking 339 
8 Branch-And-Bound 379 
9 Algebraic Problems 415 
10 Lower Bound Theory 457 
11 NP-Hard and NP-Complete Problems 495 
12 Approximation Algorithms 557 
13 PRAM Algorithms 605 
14 Mesh Algorithms 667 
15 Hypercube Algorithms 723 
Index 761

ÇöÀç E=Computer Algorithms C++ (Hardcover)¿¡ µî·ÏµÈ ¼­ÆòÀÌ ¾ø½À´Ï´Ù.

elite2000/30 DDCFFEA2877D44D2A2866D2F20241123