[»õÃ¥] ÀڷᱸÁ¶C++ÇÁ·Î±×·¡¹Ö
ÂòÇϱ⠰øÀ¯Çϱâ
  • ±¸ÀÔ¿¬µµ
    È®ÀξȵÊ
    ÃâÆÇ¿¬µµ
    Ç¥±â¾ÈµÊ
  • ÃâÆÇ»ç
    ºÎ»ê´ëÇб³ÃâÆǹ®È­¿ø  
    ISBN
    9788973167524
  • ÀúÀÚ
    È«ºÀÈñ
  • ±¸¼º
    ¡ÚÁ¤Ç°¡Ú
  • µµ¼­Á¤º¸
    297 , 187*256*0 , 2022.08.31
  • µµ¼­µî±Þ
    »õÃ¥
  • »ó¼¼»óÅÂ
    ¡ÚÃֽŠ°³Á¤ÆÇ »õÃ¥¡Ú
  • Á¤°¡
    19,000¿ø
  • ÆǸŰ¡
    19,000¿ø (¼Òµæ°øÁ¦ÇýÅÃ: 855¿ø ÀÚ¼¼È÷)
  • ¹è¼Ûºñ
    ¹«·á ¡­ 3,000¿ø
¡ÚÃֽŠ°³Á¤ÆÇ »õÃ¥¡Ú

 

»ó¼¼Á¤º¸

1Àå ÀڷᱸÁ¶°¡ ÇÊ¿äÇÑ ÀÌÀ¯´Â?1.1 Çà·Ä ¿¬»êÀ» ÇÏ´Â C ÇÁ·Î±×·¡¹Ö ¹®Á¦ 81.2 C++ class ÇÁ·Î±×·¡¹Ö 111.3 ¾Ë°í¸®Áò ±¸Çö 252Àå ¹è¿­ ±â¹Ý ÀڷᱸÁ¶2.1 Set°ú Bag ÀڷᱸÁ¶ 302.2 ArrayList¿Í Vector ÀڷᱸÁ¶ 342.3 Polynomial class 373Àå Stacks°ú Queues3.1 C++ÀÇ Templates 483.2 Adaptive containers: Stack°ú Queue 503.3 Bag ÀڷᱸÁ¶ 523.4 Stack ÀڷᱸÁ¶ 563.5 Queue ÀڷᱸÁ¶ 583.6 Deque ÀڷᱸÁ¶ 623.7 ¹Ì·Î ã±â 623.8 StackÀ» ÀÌ¿ëÇÑ Postfix expression 713.9 Queen ¹®Á¦¿Í Knight tour ¹®Á¦ 764Àå Linked List4.1 Sinlgy linked lists 784.2 C++·Î Linked List Ç¥Çö 794.3 Template linked list 804.4 Linked list iterators 814.5 Circular lists 914.6 Linked stacks°ú Queues 1024.7 Linked list¸¦ »ç¿ëÇÑ Polynomial ó¸® 1064.8 Available list¸¦ »ç¿ëÇÑ Polynomial ó¸® 1144.9 Doubly linked lists 1294.10 Generalized lists 1364.11 Heterogeneous lists 1465Àå Trees5.1 Tree ¿ë¾î 1605.2 Binary tree Ç¥Çö 1625.3 Binary tree traversal°ú Tree iterations 1655.4 Satisfiability ¹®Á¦ 1795.5 Threaded binary trees 1875.6 Heaps 1985.7 Binary search trees 2125.8 Sets Ç¥Çö 2205.9 C++ STL map°ú Set 2266Àå Graphs6.1 Graph ¿ë¾î 2286.2 Graph Ç¥Çö ±¸Á¶ 2296.3 DFS¿Í BFS 2396.4 ÃÖ¼Ò ºñ¿ë Spanning tree 2406.5 Shortest paths 2626.6 Activity networks 277| Âü°í¹®Çå | 297
 

¼­Æòº¸±â

±¸¸ÅÁß³»¿ª

µ¿ÀÏÇÑ µµ¼­¸íÀÇ Á¦Ç°À» ÆǸÅÇÏ´Â ´Ù¸¥ ÆǸÅÀÚÀÇ ÁÖ¹®³»¿ªµµ Æ÷ÇԵǾî ÀÖ½À´Ï´Ù.

ÁÖ¹®ÀÚ(ID) »óÅ ½Ã°£ ÁÖ¹®ÀÚ(ID) »óÅ ½Ã°£ ÁÖ¹®ÀÚ(ID) »óÅ ½Ã°£
±¸¸ÅÁß ³»¿ªÀÌ ¾ø½À´Ï´Ù.
 

´ÜÇົ BEST µµ¼­

³ªÀǼîÇÎ

  • Ä«µå³»¿ªÁ¶È¸
  • ¸¸Á·µµº¸±â
  • ÆǸÅÀÚº¸±â

ÃÖ±Ùº»»óÇ°

Àå¹Ù±¸´Ï

TOP