| ²é¿´: 447 | »Ø¸´: 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 ] |
» ²ÂÄãϲ»¶
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ5È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ4È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ7È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ4È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ8È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ5È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ8È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ8È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ5È˻ظ´
ÊÛT0PÒ»ÇøSCIÎÄÕ£¬ÎÒ:8O5.51.O.54,¿ÆÄ¿ÆëÈ«,¿É£«¼±
ÒѾÓÐ3È˻ظ´
3Â¥2009-11-08 10:38:22
5Â¥2009-11-08 13:13:14
¼òµ¥»Ø¸´
nono20092Â¥
2009-11-07 12:25
»Ø¸´
лл·ÖÏí¡£
wangen9944Â¥
2009-11-08 11:11
»Ø¸´

ÓàÔó³É6Â¥
2010-01-20 17:54
»Ø¸´
лл·ÖÏí£¡











»Ø¸´´ËÂ¥
170