- Data Structures and Algorithms: ±³À°°úÁ¤ ¹× °ÀÇÀÚ·á
PART I. ÀڷᱸÁ¶¿Í ¾Ë°í¸®Áò ±âÃÊ
Chapter 00. ÇÁ·Î±×·¡¹Ö ¾ð¾î (Programming Languages)
- ÀýÂ÷Àû ¾ð¾î, °´Ã¼ÁöÇâ ¾ð¾î, ½ºÅ©¸³Æ® ¾ð¾î µî
Chapter 01. ÀڷᱸÁ¶¿Í ¾Ë°í¸®ÁòÀÇ ÀÌÇØ (Understanding Data Structures and Algorithms)
- ÀڷᱸÁ¶, ¾Ë°í¸®Áò: ¾Ë°í¸®ÁòÀÇ Ç¥Çö
- ¾Ë°í¸®Áò ¼³°è¿Í ºÐ¼®: ¾Ë°í¸®Áò º¹Àâµµ
Chapter 02. Àç±Í¿Í ±Í³³Àû »ç°í (Recursion and Inductive Thinking)
- Àç±Í¿Í ¼öÇÐÀû ±Í³³¹ý
- Àç±Í ÇÔ¼ö: ¹Ýº¹Àû.Àç±ÍÀû ¿ë¹ý
Chapter 03. Á¤·Ä°ú °Ë»ö ¾Ë°í¸®Áò (Sort and Search Algorithms)
- ±âÃÊÀûÀÎ Á¤·Ä°ú °Ë»ö ¾Ë°í¸®Áò
- °í±Þ.Ư¼ö Á¤·Ä ¾Ë°í¸®Áò
PART II. ÀڷᱸÁ¶
Chapter 04. ¸®½ºÆ® (List)
- ¼±Çü ¸®½ºÆ®, ¿¬°á ¸®½ºÆ®
- ¿¬°á ¸®½ºÆ® ±¸Çö: ´Ü¼ø.¿øÇü.ÀÌÁß ¿¬°á ¸®½ºÆ®
Chapter 05. ½ºÅà (Stack)
- ½ºÅÃÀÇ ÀÌÇØ: ´Ù¾çÇÑ ½ºÅà Ȱ¿ë
- ½ºÅà ±¸Çö: ¼øÂ÷.¿¬°á ÀڷᱸÁ¶
Chapter 06. ť (Queue)
- Å¥ÀÇ ÀÌÇØ: ´Ù¾çÇÑ Å¥ È°¿ë
- Å¥ ±¸Çö: ¼øÂ÷.¿¬°á ÀڷᱸÁ¶
Chapter 07. Æ®¸® (Tree)
- Æ®¸®ÀÇ ÀÌÇØ: ÀÌÁø Æ®¸®
- ¿ì¼± ¼øÀ§ Å¥¿Í Èü: Èü Á¤·Ä
Chapter 08. °Ë»ö Æ®¸® (Search Tree)
- ÀÌÁø °Ë»ö Æ®¸®: ÀÌÁø °Ë»ö Æ®¸® ¿¬»ê
- ±ÕÇü ÀÌÁø °Ë»ö Æ®¸®: AVL Æ®¸®, ·¹µå-ºí·¢ Æ®¸®
- ±ÕÇü ´ÙÁø °Ë»ö Æ®¸®: 2-3-4 Æ®¸®, B-Æ®¸®
Chapter 09. Çؽà Å×À̺í (Hash Table)
Chapter 10. ±×·¡ÇÁ ¾Ë°í¸®Áò (Graph Algorithms)
- ±×·¡ÇÁÀÇ ÀÌÇØ: ±×·¡ÇÁ ¿ë¾î¿Í Á¾·ù ±×¸®°í Ç¥Çö ¹æ¹ý
- ±×·¡ÇÁ ¼øȸ: ±íÀÌ ¿ì¼± Ž»ö(DFS), ³Êºñ ¿ì¼± Ž»ö(BFS)
- ÃÖ¼Ò ½ÅÀå Æ®¸®, À§»ó Á¤·Ä, ÃÖ´Ü °æ·Î
PART III. ¾Ë°í¸®Áò ¼³°è¿Í ºÐ¼®
Chapter 11. °í±Þ ¾Ë°í¸®Áò (Advanced Algorithms)
- ÁýÇÕÀÇ Ã³¸®
- µ¿Àû ÇÁ·Î±×·¡¹Ö
- Ž¿å ¾Ë°í¸®Áò
- ¹®ÀÚ¿ ¸ÅĪ, NP-¿Ïºñ
- »óÅ °ø°£ Æ®¸®ÀÇ Å½»ö
Appendix A.
|