|
¥DÃD¹Ï®Ñ
|
|
¥N²zÁ`¸g¾P
|
|
¸ê®Æµ²ºc
|
|
||||||||||||||||||||||||||||
¥»®Ñ²¤¶ | |||||||||||||||||||||||||||||
¥»®Ñ¤D°ªÂI¦W®v¤ýPüL¨Ì¦h¦~±Ð¾Ç¸gÅç¤Î¬ã¨s©Ò©RÃDÁͶեþ·s¼¶¼g¡A¤º®e²[»\«×¸û¥þ±¡A¿Ä¤JºtºâªkÆ[©À»P®Ä¯à¤ÀªR¤èªk¡A¤D¦¨¬°¥»®Ñ¼¶¼gªº«n·§©À¡C ¥»®Ñ¾A¦X³ø¦Ò¸ê°T©Ò¡B¸êºÞ©Ò¡B¹q¾÷©Ò¤Î¬ÛÃö¨t©Òªº¦Ò¥Í¨Ï¥Î¡A¤º®e¸g¨t²Î¤Æ¾ã²z¡A¨Ì³¹¸`¤ÀÃþÂk¯Ç¡Bºë¤ß¾ã²z¥X¦U³¹¸`nÂI¡A¨Ãºë¿ï¥X¨ã¥Nªí©Ê»P«n©Ê¤§¸ÕÃD¡]·s¼W¦Ü108¦~¡^¡A¥[¥H¸ÔºÉ¸ÑªR¡A´Á¯à¨ó§U¦Ò¥Í¡A¥H¸ûµu®É¶¡´x´¤¦Ò¸ÕªºnÂI¡A¨Ãºt½m¨ã¦³¥Nªí©Êªº¸ÕÃD¡A¥H¹F¨Æ¥b¥\¿¤§®Ä¡C ¥»®Ñ¤À¬°¤Q¤@³¹¡A¥H´`§Çº¥¶i¤è¦¡¡A±j½Õ¦U³¹©RÃD«ÂI¡A¬[ºc¼h¦¸¤À©ú¡A»²¥H½d¨Ò¸ÔºÉ¸ÑªR¡A¨ÏŪªÌ¦b¬ãŪ®É²Ïîڰò¡A±q®e±¹ï¦UÃþ¸ÕÃD¡C |
|||||||||||||||||||||||||||||
¹Ï®Ñ¥Ø¿ý | |||||||||||||||||||||||||||||
Chapter 1¡@ºü¡@½×(Introduction)
Chapter 2¡@°}¡@¦C(Arrays) Chapter 3¡@Ãìµ²¦ê¦C(Linked Lists) Chapter 4¡@°ïÅ|»P¦î¦C(Stacks and Queues) Chapter 5¡@»¼¡@°j(Recursion) Chapter 6¡@¾ð(Trees) Chapter 7¡@°ï¿nµ²ºc»PÀu¥ýÅv¦î¦C(Heap Structures and Priority Qurues) Chapter 8¡@¹Ï¡@§Î(Graphs) Chapter 9¡@¾ðª¬·j´Mµ²ºc(Searching Tree Structures) Chapter 10¡@±Æ§Çªk(Sorting) Chapter 11¡@·j´Mªk(Searching) |
|||||||||||||||||||||||||||||
ª`·N¨Æ¶µ¡G | |||||||||||||||||||||||||||||
1. ±ý¿ïÁÊ¡i«ö½g¦C¦L¡j¡A½Ð¥ýÁʶR¡i¤ë¥¹ª¾ÃÑ®wÂI¼Æ¡j§Y¥i¦Û¦æ¤U¸ü¦C¦L¡C 2. ÁʶR¡i¤ë¥¹ª¾ÃÑ®w¡jªº·|û¡A¦b±z§¹¦¨¥I´Ú¤âÄò¤§«á¡A§Ú̱N©ó¤@¦Ü¤GÓ¤u§@¤Ñ¤º¡A¥H email ±M¨ç³qª¾±z±Ò¥ÎÂI¼Æ¡C ¡@Y¦³«æ»Ý¨Ï¥ÎªÌ¡A½Ð¬¢«ÈªA±M½u 886-2-23756688 ¤À¾÷ 502 ¡ã 505¡A§Ú̱N¥H¡uÀH¿ï¦C¦L¡v¤è¦¡´£¨Ñ¡C 3. ½u¤WÁʮѨì³f¤C¤é¤º¡A¦p¹ï®ÑÄy¤º®e¦³¥ô¦óºÃ¼{¥²¶·´«³fªÌ¡A½Ð©ó¤C¤é¤º³s¦Pµo²¼±H¦^¥»¤½¥q§ó´«¡C 4. ®ÑÄy°h´«³f³B²z§@·~®É¶¡¬ù¤QÓ¤u§@¤Ñ ( ¤£§t¨Ò°²¤é )¡C 5. ¥Ñ©ó³f¹B¤½¥q°e³f¨ì©²»Ý¸gñ¦¬¤âÄò¡A½Ð°È¥²¯d¤U¦³¤H¥iñ¦¬¤§¦¬¥ó¦a§}¡AÁקK³f¥óº¢¯d³f¹B ¤½¥q©µÌX¦¬¥ó¡B®É¶¡·l¥¢¡C 6. Y±z¿ïÁʪº®ÑÄy¥]§t¹wÁʮѡA¥»¯¸±N±Ä§å¦¸±Hµo§@·~¡A«Ý¥X®Ñ«á¤@¨Ö±Hµo¡FY»Ý¤À¦¸±Hµo¡A°u¦¬ 80 ¤¸ª«¬y³B²z¶O¡C 7. 2016¦~1¤ë1¤é°_¡A¤ë¥¹ª¾ÃÑ®wÂI¼Æ¡B¤ë¥¹«~µû®a¡B¤¸·Ó¹q¤l®Ñ¡B¤ë¥¹Âø»x¨t¦C¹q¤lª©¤£¾A¥Î¤C¤ÑŲ½à´ÁªA°È¡C>>¸Ô²Ó»¡©ú<< 8. ¤¸·Óºô¸ô®Ñ©±«O¯d±µ¨üq³æ»P§_ªºÅv§Q¡C 9. ¤¸·Óºô¸ô®Ñ©±«ÈªA±M½u¡G886-2-2375-6688 ¤À¾÷ 502 ¡ã 505¡C |