| ²é¿´: 415 | »Ø¸´: 5 | ||
| ¡¾½±Àø¡¿ ±¾Ìû±»ÆÀ¼Û5´Î£¬×÷Õ߿Ƽ¼¹¤×÷Ôö¼Ó½ð±Ò 4.5 ¸ö | ||
| µ±Ç°Ö÷ÌâÒѾ´æµµ¡£ | ||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | ||
[×ÊÔ´]
¡¾·ÖÏí¡¿Design and Analysis of Computer Algorithms1
|
||
|
title: Design and Analysis of Computer Algorithms1 author: David M. Mount Time:Fall 2003 publishing company: Department of Computer Science University of Maryland introduce: Our text defines an algorithm to be any well-defined computational procedure that takes some values as input and produces some values as output. Like a cooking recipe, an algorithm provides a step-by-step method for solving a computational problem. Unlike programs, algorithms are not dependent on a particular programming language, machine, system, or compiler. They are mathematical entities, which can be thought of as running on some sort of idealized computer with an infinite random access memory and an unlimited word size. Algorithm design is all about the mathematical theory behind the design of good programs. note:±¾ÊéÊÇÓ¢Îĵģ¬ÓÐÓ¢ÓïÔĶÁÄÜÁ¦µÄ¿ÉÒÔ¿´¡£ [ Last edited by ¿Æ¼¼¹¤×÷ on 2009-11-7 at 12:13 ] |
» ²ÂÄãϲ»¶
0856Çóµ÷¼Á
ÒѾÓÐ13È˻ظ´
0703»¯Ñ§
ÒѾÓÐ11È˻ظ´
329Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
321Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
0856²ÄÁÏ»¯¹¤µ÷¼Á ×Ü·Ö330
ÒѾÓÐ12È˻ظ´
309Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
070300»¯Ñ§354Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
330·ÖÇóµ÷¼Á
ÒѾÓÐ3È˻ظ´
299Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
Ò»Ö¾Ô¸±±¾©Àí¹¤´óѧ±¾¿Æ211²ÄÁϹ¤³Ì294Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
3Â¥2009-11-08 10:38:22
5Â¥2009-11-08 13:13:14














»Ø¸´´ËÂ¥
10