天津大学:《数据结构 Data Structures》课程PPT教学课件(英文版)CHAPTER 2 ALGORITHM ANALYSIS

(1) Input There are zero or more quantities that are externally supplied. (2) Output At least one quantity is produced. (3) Definiteness Each instruction is clear and unambiguous. (4) Finiteness If we trace out the instructions of an algorithm, then for all cases, the algorithm terminates after finite number of steps. (5) Effectiveness Every instruction must be basic enough to be carried out, in principle, by a person using only pencil and paper. It is not enough that each operation be definite as in(3); it also must be feasible.
文件格式:PPT,文件大小:531KB,售价:8.14元
文档详细内容(约28页)
点击进入文档下载页(PPT格式)

您可能感兴趣的文档

点击购买下载(PPT)

下载及服务说明

  • 购买前请先查看本文档预览页,确认内容后再进行支付;
  • 如遇文件无法下载、无法访问或其它任何问题,可发送电子邮件反馈,核实后将进行文件补发或退款等其它相关操作;
  • 邮箱: