¾Ë°í¸®ÁòÀÇ ±âº» °³³ä°ú ¿ë¾î¸¦ ¾Ë±â½±°Ô Ç®ÀÌÇÑ Ã¥. ±âº»ÀûÀÎ ÀڷᱸÁ¶¿¡¼ ¾î·Á¿î ÀڷᱸÁ¶±îÁö ±× ¿ø¸®¿Í C·Î ±¸ÇöÇÔ¿¡ ÀÖ¾î¼ÀÇ ¹®Á¦Á¡À» »ó¼¼È÷ ¼Ò°³Çß´Ù. Àç±ÍÈ£Ãâ¿¡ ´ëÇÑ Çؼ®¹ý°ú Àç±ÍÈ£ÃâÀ» Á¦°ÅÇÏ´Â ¹æ¹ýÀ» ü°èÀûÀ¸·Î ¼³¸íÇß´Ù.
001. ÀÏ·¯µÎ±â
002. °³¿ä
003. C¾ð¾î
004. ÀڷᱸÁ¶
005. Àç±ÍÈ£Ãâ
006. Á¤·Ä ¾Ë°í¸®Áò
007. °Ë»ö
Á¦7Àå ±×·¡ÇÁ(Graph)
7.1 ±âº»°³³ä
7.2 ±×·¡ÇÁ ±â¼ú
7.3 Ž»ö(Search)
7.4 ÀÌÁß¿¬°á(Biconnectivity)
7.5 ÁýÇÕÀÇ Ç¥Çö(Representation of Set)
7.6 °¡Áß ±×·¡ÇÁ(Weighted Graph)
7.7 ¹æÇâ ±×·¡ÇÁ(Directed Graph)
7.8 ³×Æ®¿öÅ©(Network)
7.9 Á¤¸®
Á¦8Àå ¼öÇÐ ¾Ë°í¸®Áò
8.1 ÄÄÇ»ÅÍ¿Í ¼ö
8.2 ´ÙÇ×½Ä(Polynomal)
8.3 Çà·Ä(Matrix)
8.4 ¹æÁ¤½ÄÀÇ ±Ùã±â(Root Finding)
8.5 ¼öÄ¡ ¹ÌºÐ(Numerical differentiation)
8.6 ¼öÄ¡ ÀûºÐ(Numerical integration)
8.7 ³¼ö(Random number)
8.8 ¼ø¿°ú Á¶ÇÕ(Permutation & Combination)
8.9 ȸ±Í
Á¦9Àå ±âÇÏ ¾Ë°í¸®Áò
9.1 ¼Ò°è
9.2 12h
9.3 13h ±×·¡ÇÈ ¸ðµå
9.4 ¼±(Line)
9.5 ¿ø(Circle)
9.6 Ÿ¿ø(Ellipse)
9.7 ä¿ì±â ¾Ë°í¸®Áò(Fill)
9.8 ½ºÇöóÀÎ(Spline)
9.9 ±×·¡ÇÈ ¶óÀ̺귯¸® Á¶¼º
9.10 µÎ ¼±ºÐÀÇ ±³Â÷ ¿©ºÎ È®ÀÎ
9.11 ´Ù°¢Çü(Polygon)
9.12 ¹üÀ§ °Ë»ö(Range Searching)
9.13 ÃÖ±ÙÁ¡ ã±â(Closest pair of points)
Á¦10Àå ½ºÆ®¸µÃ³¸® ¾Ë°í¸®Áò
10.1 ¹®ÀÚ¿ °Ë»ö(String searching)
10.2 ¼ö½ÄºÐ¼®°ú °è»ê(expression parsing evaluation)
10.3 ÆÄÀÏ ¾ÐÃàÇϱâ(File compression)
ºÎ·Ï
ºÎ·Ï1. µµÀûÀûÀÎ µ¶ÀÚ¸¦ À§ÇØ
ºÎ·Ï2. ¼Ò½º µð½ºÄÏ ¼³¸í
ºÎ·Ï3. Âü°í ¹®Çå