±¹³»µµ¼
Àü°øµµ¼/´ëÇб³Àç
°øÇаè¿
ÄÄÇ»ÅÍ°øÇÐ
2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.
Á¤°¡ |
19,000¿ø |
---|
19,000¿ø
570P (3%Àû¸³)
ÇÒÀÎÇýÅÃ | |
---|---|
Àû¸³ÇýÅà |
|
|
|
Ãß°¡ÇýÅÃ |
|
À̺¥Æ®/±âȹÀü
¿¬°üµµ¼
»óÇ°±Ç
ÀÌ»óÇ°ÀÇ ºÐ·ù
Ã¥¼Ò°³
SW ÄÚµù ¿ª·®Àº ÀڷᱸÁ¶ ±¸Çö ´É·Â¿¡ ´Þ·Á ÀÖ´Ù. ¾î¶² ÀڷᱸÁ¶¸¦ »ç¿ëÇÏ´À³Ä¿¡ µû¶ó ±¸ÇöµÈ SWÀÇ ¼º´É°ú ±â´ÉÀÌ ´Þ¶óÁø´Ù. SW °³¹ßÀº class¿Í ÇÔ¼ö¸¦ ¸¸µå´Â °ÍÀÌ´Ù. main( ) ÇÔ¼ö´Â °¡´ÉÇÑ ÇÑ µ¥ÀÌÅÍ ÀÔ·Â, insert, delete, search µîÀÇ ´Ù¸¥ ÇÔ¼ö È£Ã⸸ »ç¿ëÇÏ´Â °ÍÀÌ ÁÁ´Ù. SW ÄÚµù ´É·ÂÀº class¿¡ ¾î¶² ÇÔ¼ö¸¦ ¸¸µé°í ¾î¶² º¯¼ö¸¦ »ç¿ëÇÏ¿© ¾Ë°í¸®ÁòÀ» ±¸ÇöÇÒ °Í¿¡ ´ëÇÑ design choice¸¦ ÀßÇÏ´Â ´É·ÂÀÌ´Ù. ¿¹¸¦ µé¸é search ÇÔ¼ö¸¦ ¸¸µé ¶§ classÀÇ public member ÇÔ¼ö·Î ¸¸µé °ÍÀÎÁö ¾Æ´Ï¸é ÀÏ¹Ý ÇÔ¼ö·Î ¸¸µé °ÍÀÎÁö¸¦ ¼±ÅÃ(choice)ÇØ¾ß ÇÑ´Ù.
C++ ¾ð¾î¸¦ ±¸»çÇÒ ¼ö ÀÖ¾î¾ß C++·Î µÈ ÀڷᱸÁ¶¸¦ °øºÎÇÒ ¼ö ÀÖ´Ù. ÀÌ Ã¥Àº C++¸¦ »ç¿ëÇÏ¿© ±¸ÇöµÈ ¼Ò½º Äڵ带 Æ÷ÇÔÇÏ°í ÀÖ´Ù. ÀڷᱸÁ¶´Â ÀÌ·Ð °ú¸ñÀÌ ¾Æ´Ï¹Ç·Î °¢ ÀڷᱸÁ¶¿¡ ´ëÇÏ¿© ¼Ò½º Äڵ带 »ç¿ëÇÏ¿© ±¸ÇöÇÏ°í testÇÏ´Â ½Ç½ÀÀ¸·Î ½ÀµæÇØ¾ß ÇÑ´Ù. ÃßõÇÏ´Â ÀڷᱸÁ¶ ÇнÀ ¹æ¹ýÀº ´Ü¼øÈ÷ Á¦½ÃµÈ ¼Ò½º Äڵ带 º¸Áö ¸»°í ÇÊ¿äÇÑ ¼Ò½º Äڵ带 ÀÛ¼ºÇÏ´Â ¿¬½ÀÀ» ¹Ýº¹ÇÏ´Â °ÍÀÌ´Ù. ±×¸®°í Á¦½ÃµÈ ¼Ò½º Äڵ忡 »õ·Î¿î ±â´ÉÀ» Ãß°¡Çϰųª ¼º´ÉÀ» °³¼±ÇÏ´Â ¼Ò½º ÄÚµå º¯°æ ÀÛ¾÷À» ÅëÇÏ¿© ±¸Çö ´É·ÂÀ» Çâ»óÇÏ´Â °ÍÀÌ ¹Ù¶÷Á÷ÇÏ´Ù.
ÀÌ Ã¥¿¡¼´Â ÀڷᱸÁ¶¿¡ ´ëÇÑ insert, delete, search µîÀ» ó¸®Çϱâ À§ÇÏ¿© ÀÔ·Â µ¥ÀÌÅ͸¦ ¹Þ¾Æ ÇØ´ç ÀڷᱸÁ¶¸¦ ¸¸µå´Â ¹æ¹ý¿¡ ÁßÁ¡À» µÎ¾ú´Ù. ±¸ÇöÇÏ°íÀÚ ÇÏ´Â ÀڷᱸÁ¶¸¦ µ¿ÀÛ½ÃÅ°±â À§ÇØ È¸é¿¡¼ µ¥ÀÌÅ͸¦ ÀÓÀÇ·Î ÀԷ¹ްųª ³¼ö¸¦ »ý¼ºÇÏ¿© ÀÚµ¿À¸·Î ÇØ´ç ÀڷᱸÁ¶¸¦ ¸¸µå´Â ¹æ¹ýÀ¸·Î ½Ç½ÀÇÏ´Â °ÍÀÌ È¿°úÀûÀÌ´Ù.
ÀڷᱸÁ¶¿Í ¾Ë°í¸®ÁòÀº º°°³ÀÇ ´Ù¸¥ ÁÖÁ¦°¡ ¾Æ´Ï°í ¸Å¿ì ¹ÐÁ¢ÇÏ¿© °ÅÀÇ ÇϳªÀÇ topicÀ̶ó°í »ý°¢ÇØ¾ß ÇÑ´Ù. ¿¹¸¦ µé¸é 2°³ÀÇ linked list¸¦ merge ÇÏ´Â ¾Ë°í¸®ÁòÀÇ ±¸ÇöÀº singly linked list, circular linked list, head node°¡ ÀÖ´Â circular linked list µî¿¡ µû¶ó ´Þ¶óÁø´Ù. Áï, classÀÇ data member º¯¼ö¸¦ ¾î¶»°Ô »ç¿ëÇÏ´À³Ä¿¡ µû¶ó ±¸Çö ¾Ë°í¸®ÁòÀÌ º¹ÀâÇØÁú ¼öµµ ÀÖ°í °£´ÜÇØÁú ¼öµµ ÀÖ´Ù. µû¶ó¼ ÀڷᱸÁ¶ÀÇ ¼³°è, ÀڷᱸÁ¶ÀÇ data representation¿¡ µû¶ó ¾Ë°í¸®ÁòÀÇ ¼º´Éµµ ´Þ¶óÁú ¼ö ÀÖ´Ù.
stack, queue, linked list, tree, hashingÀº C++ STL¿¡¼ Á¦°øÇϹǷΠ±»ÀÌ ÀڷᱸÁ¶¸¦ ¸¸µé ÇÊ¿ä°¡ ¾ø´Ù°í ¿ÀÇØÇÒ ¼ö ÀÖ´Ù. C++ STLÀ» »ç¿ëÇÏ¸é ±¸ÇöÀÌ °£´ÜÇØÁú ¼ö´Â ÀÖÀ¸³ª ¼º´ÉÀÌ ¶³¾îÁú ¼ö ÀÖ´Ù. ÀÀ¿ë¿¡ µû¶ó C++ STLÀ» °¡Á®´Ù »ç¿ëÇÏ´Â °ÍÀÌ ÁÁÀ» ¼öµµ ÀÖ°í Á÷Á¢ hash map, heap µîÀ» ±¸ÇöÇÏ¿© »ç¿ëÇÏ´Â °ÍÀÌ ´õ ¿ì¼öÇÒ ¼öµµ ÀÖ´Ù.
ÀڷᱸÁ¶¿Í ¾Ë°í¸®Áò ³»¿ëÀ¸·Î ÀÌ Ã¥¿¡¼ ´Ù·çÁö ¸øÇÑ heap structure·Î¼ leftist tree, binomial heaps, Fibonacci heaps¿Í search structures·Î¼ AVL tree, 2-3 trees, 2-3-4 trees, red-black tree, B-tree, splay trees, digital search tree, trie¸¦ ÇнÀÇÏ¿© SW ÄÚµùÀÇ ÁøÁ¤ÇÑ °í¼ö°¡ µÇ±â¸¦ ¹Ù¶õ´Ù.
¸ñÂ÷
1Àå ÀڷᱸÁ¶°¡ ÇÊ¿äÇÑ ÀÌÀ¯´Â?
1.1 Çà·Ä ¿¬»êÀ» ÇÏ´Â C ÇÁ·Î±×·¡¹Ö ¹®Á¦ 8
1.2 C++ class ÇÁ·Î±×·¡¹Ö 11
1.3 ¾Ë°í¸®Áò ±¸Çö 25
2Àå ¹è¿ ±â¹Ý ÀڷᱸÁ¶
2.1 Set°ú Bag ÀڷᱸÁ¶ 30
2.2 ArrayList¿Í Vector ÀڷᱸÁ¶ 34
2.3 Polynomial class 37
3Àå Stacks°ú Queues
3.1 C++ÀÇ Templates 48
3.2 Adaptive containers: Stack°ú Queue 50
3.3 Bag ÀڷᱸÁ¶ 52
3.4 Stack ÀڷᱸÁ¶ 56
3.5 Queue ÀڷᱸÁ¶ 58
3.6 Deque ÀڷᱸÁ¶ 62
3.7 ¹Ì·Î ã±â 62
3.8 StackÀ» ÀÌ¿ëÇÑ Postfix expression 71
3.9 Queen ¹®Á¦¿Í Knight tour ¹®Á¦ 76
4Àå Linked List
4.1 Sinlgy linked lists 78
4.2 C++·Î Linked List Ç¥Çö 79
4.3 Template linked list 80
4.4 Linked list iterators 81
4.5 Circular lists 91
4.6 Linked stacks°ú Queues 102
4.7 Linked list¸¦ »ç¿ëÇÑ Polynomial ó¸® 106
4.8 Available list¸¦ »ç¿ëÇÑ Polynomial ó¸® 114
4.9 Doubly linked lists 129
4.10 Generalized lists 136
4.11 Heterogeneous lists 146
5Àå Trees
5.1 Tree ¿ë¾î 160
5.2 Binary tree Ç¥Çö 162
5.3 Binary tree traversal°ú Tree iterations 165
5.4 Satisfiability ¹®Á¦ 179
5.5 Threaded binary trees 187
5.6 Heaps 198
5.7 Binary search trees 212
5.8 Sets Ç¥Çö 220
5.9 C++ STL map°ú Set 226
6Àå Graphs
6.1 Graph ¿ë¾î 228
6.2 Graph Ç¥Çö ±¸Á¶ 229
6.3 DFS¿Í BFS 239
6.4 ÃÖ¼Ò ºñ¿ë Spanning tree 240
6.5 Shortest paths 262
6.6 Activity networks 277
| Âü°í¹®Çå | 297
ÀúÀÚ¼Ò°³
»ý³â¿ùÀÏ | - |
---|
Ãâ°£ÀÛÀ¸·Î ¡ºÀڷᱸÁ¶C++ÇÁ·Î±×·¡¹Ö¡» µîÀÌ ÀÖ´Ù.
ÀúÀÚÀÇ ´Ù¸¥Ã¥
Àüüº¸±âÁÖ°£·©Å·
´õº¸±â»óÇ°Á¤º¸Á¦°ø°í½Ã
À̺¥Æ® ±âȹÀü
Àü°øµµ¼/´ëÇб³Àç ºÐ¾ß¿¡¼ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥
ÆǸÅÀÚÁ¤º¸
»óÈ£ |
(ÁÖ)±³º¸¹®°í |
---|---|
´ëÇ¥ÀÚ¸í |
¾Èº´Çö |
»ç¾÷ÀÚµî·Ï¹øÈ£ |
102-81-11670 |
¿¬¶ôó |
1544-1900 |
ÀüÀÚ¿ìÆíÁÖ¼Ò |
callcenter@kyobobook.co.kr |
Åë½ÅÆǸž÷½Å°í¹øÈ£ |
01-0653 |
¿µ¾÷¼ÒÀçÁö |
¼¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù) |
±³È¯/ȯºÒ
¹ÝÇ°/±³È¯ ¹æ¹ý |
¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼ ½Åû °¡´É |
---|---|
¹ÝÇ°/±³È¯°¡´É ±â°£ |
º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É |
¹ÝÇ°/±³È¯ ºñ¿ë |
º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã |
¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯ |
·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì |
»óÇ° Ç°Àý |
°ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½ |
¼ÒºñÀÚ ÇÇÇغ¸»ó |
·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© ó¸®µÊ ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀǼҺñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ |
(ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
(ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.
¹è¼Û¾È³»
±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.
Ãâ°í°¡´É ½Ã°£ÀÌ ¼·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.
±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.
¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.