|
|
|
HOME > ÄÄÇ»ÅÍ > > µµ¼ »ó¼¼ Á¤º¸ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
¡Ø |
¹è¼Ûºñ¾È³» |
: |
±¸¸Å±Ý¾× 30,000¿øÀÌ»ó ¹«·á¹è¼Û |
|
|
|
|
|
|
|
|
|
|
|
|
µµ¼¼³¸í |
| |
¸ñÂ÷ |
| |
ÀúÀÚ/¿ªÀÚ Á¤º¸ |
| |
µ¶ÀÚ¼Æò |
| |
¿¹Á¦¼Ò½º |
| |
Á¤¿ÀÇ¥ |
|
|
|
|
2009 ¹®È°ü±¤ºÎ ¿ì¼öÇмúµµ¼ ¼±Á¤
³ª´Â ±ÛÀ» ¾²´Â »ç¶÷À» ÂüÀ¸·Î Á¸°æÇÑ´Ù. ´Ù½Ã±Ý 3³â ¸¸¿¡ Ã¥À» ³»Áö¸¸ Ã¥À» ÁýÇÊÇÑ´Ù´Â °ÍÀº ÂüÀ¸·Î ¾î·Æ°í Èûµç ÀÏÀÌ´Ù. ÇÏÁö¸¸ Å»°í´Â Ç×»ó Çü¿ëÇÒ ¼ö ¾ø´Â ±â»ÝÀ» ³ª¿¡°Ô ÁØ´Ù. Å»°íÀÇ Áñ°Å¿òÀÌ °è¼ÓÇؼ Ã¥À» ¾²°Ô ¸¸µå´Â µ¿·ÂÀ̶ó »ý°¢µÈ´Ù.
³ª´Â 90³âµµ Ãʹݿ¡ C++ ¾ð¾î¸¦ Á¢Çß´Ù. ±¹³»¿¡ °´Ã¼ÁöÇâ ¾ð¾î¿Í ½Ã½ºÅÛÀ» ÀüÆÄÇÑ Ãʱ⠸â¹ö Áß Çϳª¿´À½¿¡ Ʋ¸² ¾ø´Ù. ¿©·¯ °´Ã¼ ÁöÇâ ÇÁ·ÎÁ§Æ® °æÇèÀÇ »ê¹°À» Ã¥À¸·Î ³½ ÀûÀÌ ÀÖ´Ù. ¡®ÇÁ·ÎÁ§Æ® ¼º°øÀ» À§ÇÑ Å°Æ÷ÀÎÆ®. °´Ã¼ÁöÇâ C++ ÇÁ·Î±×·¡¹Ö¡¯À̶õ À̸§À¸·Î 1996³â¿¡ Ãâ°£µÈ Ã¥Àº ½ÇÀü ÇÁ·ÎÁ§Æ®¿¡¼ ¹ß»ýÇÒ ¼ö ÀÖ´Â ¿À·ù¸¦ ¹Ì¿¬¿¡ ¹æÁöÇÒ ¼ö ÀÖ´Â °³¹ß °¡À̵å·Î¼ °³¹ßÀÚ Áß½ÉÀ¸·Î ±â¼úµÇ¾ú´Ù.
2005³âµµ¿¡ ÁýÇÊÇÑ ¡®±×¸²À¸·Î Ç®¾î ¾²´Â C++¿Í ÀڷᱸÁ¶¡¯´Â ±âº»¿¡ Ãæ½ÇÇÏ°í ¿ø¸®¸¦ ÆľÇÇÏ°íÀÚ ÇÏ´Â Ãʺ¸ÀÚ¸¦ Áß½ÉÀ¸·Î ±â¼úÇÏ¿´´Ù. ¾ð¾î¿¡ ´ëÇÑ ¼³¸íÀº ´ëÈ½Ä ¼¼ú½ÄÀ¸·Î ÀÚ¼¼ÇÏ°Ô ±â¼úÇÏ¿´À¸¸ç °¡´ÉÇÑ ±×¸²°ú Å×À̺í·Î ¼³¸íÇÏ°íÀÚ ³ë·ÂÇÏ¿´°í ÃæºÐÇÑ ¿¹Á¦¿Í °úÁ¦¸¦ ÅëÇØ ¸Ó¸®¸¸ÀÌ ¾Æ´Ñ ¸öÀ¸·Î C++ ¾ð¾î¸¦ ÀÌÇØÇÒ ¼ö ÀÖµµ·Ï ±¸¼ºÇÏ¿´´Ù.
À̹ø ÁýÇÊÀº ½Ç»ýÈ°¿¡ Á¢ÇÏ´Â Çö»ó°ú ¹®Á¦¸¦ ÀڷᱸÁ¶¿Í ¾Ë°í¸®ÁòÀ¸·Î ¿¬°áÇÏ°íÀÚ ¸¹Àº ³ë·ÂÀ» ÇÏ¿´´Ù. ½Å¹®±â»ç ±¤°í ¿µÈ ³»¿ë Ã¥ÀÇ ³»¿ë ¿ì¸®°¡ Áñ±â´Â ¿À¶ôÀ» ÅëÇØ ÀڷᱸÁ¶¸¦ ¼³¸íÇÏ°í ¾Ë°í¸®ÁòÀ» Àû¿ëÇÏ´Â ¹æ¹ýÀ» Á¦½ÃÇÏ¿´´Ù. »ó´ëÀûÀ¸·Î ½±°í Áñ°Ì°Ô ÀڷᱸÁ¶¿Í ¾Ë°í¸®ÁòÀ» Á¢ÇÒ ¼ö ÀÖÀ» °ÍÀ̶ó È®½ÅÇÑ´Ù.
º» Ã¥ÀÌ ÀڷᱸÁ¶¿Í ¾Ë°í¸®ÁòÀ» ÀÌÇØÇÏ°íÀÚ ÇÏ´Â »ç¶÷µé¿¡°Ô ¸¹Àº µµ¿òÀÌ µÇ±â¸¦ Áø½ÉÀ¸·Î ¹Ù¶õ´Ù.
|
|
|
|
Chapter 1 • Introduction
1.1 °³¿ä 1.2 Timing Estimation : Big O Ç¥Çö¹ý
Chapter 2 • Arrays
2.1 ¹è¿ÀÇ ÀÇ¹Ì¿Í ÁÖ¼Ò °è»ê¹ý 2.2 ´ÙÁß ¹è¿ÀÇ ÁÖ¼Ò °è»ê¹ý
Chapter 3 • Pointers 3.1 Æ÷ÀÎÅÍ °ü·Ã ¿¬»êÀÚ 3.2 Æ÷ÀÎÅÍÀÇ ÀÇ¹Ì¿Í ¹è¿°úÀÇ °ü°è 3.3 Æ÷ÀÎÅÍÀÇ ÃʱâÈ 3.4 Æ÷ÀÎÅÍ ¿¬»ê 3.5 Æ÷ÀÎÅÍÀÇ »ó¼ö ¼±¾ð 3.6 Æ÷ÀÎÅÍÀÇ Æ÷ÀÎÅÍ 3.7 ¹è¿°ú Æ÷ÀÎÅÍÀÇ È¥¿ë 3.8 ÇÔ¼ö ÀÎÀڷμÀÇ Æ÷ÀÎÅÍ 3.9 ÇÔ¼ö Æ÷ÀÎÅÍ 3.10 ÇÔ¼ö Æ÷ÀÎÅÍ ¹è¿ 3.11 ÀÌÁß½ºÆÄÀÌ Æ÷ÀÎÅÍ
Chapter 4 • Recursion 4.1 Recursive Call Function 4.2 ÇǺ¸³ªÄ¡ ¼ö¿ 4.3 Permutation : ¼ø¿ 4.4 ´ÞÆØÀÌ ¹è¿ 4.5 H-tree pattern 4.6 Gray Code 4.7 Tower of Honoi 4.8 Eight Queen Problem
Chapter 5 • Array Sorting
5.1 Insertion Sorting 5.2 Bubble Sorting 5.3 Shell Sorting 5.4 Selection Sorting 5.5 Quick Sorting 5.6 Merge Sorting 5.7 Sorting Comparison
Chapter 6 • Array Search
6.1 Linear Search 6.2 Binary Search
Chapter 7 • Linked List
7.1 Singly Linked List 7.2 Doubly Linked List
Chapter 8 • Templates
8.1 Template °³¿ä 8.2 Class Template 8.3 Function Template
Chapter 9 • Stack
9.1 Stack 9.2 Stack : LinkedList Version
Chapter 10 • Queue 10.1 Queue 10.2 Queue : LinkedList Version 10.3 Priority Queue 10.4 Dequeue : Double Ended Queue
Chapter 11 • Trees
11.1 Tree 11.2 Binary Tree Traversal ¥§11.3 Binary Search Tree (BST)
Chapter 12 • Graphs 12.1 Graph 12.2 Graph Ç¥Çö 12.3 Graph Ž»ö 12.4 Spanning Tree 12.5 Minimum Cost Spanning Tree 12.6 Shortest Path
Chapter 13 • Sorting 13.1 Basics 13.2 Bubble Sorting 13.3 Insertion Sorting 13.4 Selection Sorting 13.5 Shell Sorting 13.6 Quick Sorting 13.7 Merge Sorting 13.8 Heap Sorting
Chapter 14 • Symbol Tables
14.1 Static Tree Tables : Huffman Code 14.2 Hash Table 14.3 Dynamic Tree Tables : Height Balanced Binary Search Tree
Chapter 15 • Applications
15.1 C++ Lexical Analyzer 15.2 Parser : Expression Tree 15.3 Calculator 15.4 Calculator : Postfix Version 15.5 Calculator : Expression Tree Version
• Appendix • Reference
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|