Programming Abstractions in C阅读笔记：p303-p305

最新推荐文章于 2024-03-21 08:07:23 发布

codists

最新推荐文章于 2024-03-21 08:07:23 发布

阅读量549

点赞数 8

文章标签： c 数据结构与算法

本文链接：https://blog.csdn.net/codists/article/details/136311145

版权

《Programming Abstractions in C》学习第74天，p303-p305总结，总计3页。

一、技术总结

1.时间复杂度分类(complexity classes)

Class	Notation	Example
constant	O(1)	Returning the first element in an array
logarithmic	O(logN)	Binary search in a sorted array
linear	O(N)	Linear search in an array
NlogN	O(NlogN)	Merge sort
quadratic	O(N^2)	Selection sort
cubic	O(^3)	Conventional algorithms for matrix multiplication
exponential	O(2^N)	Tower of Hanoi

当然，这个分类并不是绝对的，只是常见的。

二、英语总结

1.substantial是什么意思？

答：adj. large in size(sizeable)。p305, Even though the selection sort example makes it cleaar that quadratic algorithms have substantial performance problems (严重的性能问题)for large values of N， algorithms whose complexity is O(2^N) are considerably worse。

2.tractable是什么意思？

答：tractare(“to handle, manage”, treat)， adj. easily controlled。p305, As a general rule of thumb(根据经验)， computer scientists classify problem that can be solved susing algorithms that run in polynomial time as tractable, in the sense that they are amenable to implementation on a computer。