![](https://img-blog.csdnimg.cn/b4eae831f8d5453e984d6065fdacf8a3.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
MIT 6.006
文章平均质量分 86
MIT_6.006_S20 Introduction to Algorithm
Based on Python!
hairful
这个作者很懒,什么都没留下…
展开
-
Lecture07 Binary Trees II
Lecture07 Binary Trees II转载 2022-02-15 09:41:33 · 59 阅读 · 0 评论 -
Lecture06 Binary Tree I
Lecture06 Binary Trees IWhat’s a Binary Tree?Pointer-based data structures (like Liked List) can achieve worst caseBinary tree is pointer-based data structure with three pointers per node.Node representation: node.{item, parent, left, right}Implement转载 2022-02-09 17:41:57 · 70 阅读 · 0 评论 -
Lecture05 Linear Sorting
Linear Sorting转载 2022-02-08 18:07:09 · 98 阅读 · 0 评论 -
Lecture04 Hashing
Comparison Model and Decision TreeIf binary comparisons are the only way to distinguish between stored items and a search key, a deterministic comparison search algorithm can be thought of as a fixed binary decision tree representing all possible executio转载 2022-01-30 18:34:54 · 186 阅读 · 0 评论 -
Lecture02 List
Lecture02 ListSequence InterfaceDef. Sequences is a collection of items in an extrinsic order, where each item has a rank in the sequence.Set InterfaceDef. Sets maintain a collection of items based on an intrinsic property invovling what the items are转载 2022-01-21 15:24:23 · 705 阅读 · 0 评论 -
Lecture03 Sorting
Lecture03 SortingSorted ArrayGiven the comparison:We sacrifice some time ini building the data structure to speed up order queries. This is a common technique called preprocessing.The implement of sorted array:class Sorted_Array_Set: def __init__转载 2022-01-21 18:11:38 · 340 阅读 · 0 评论