首页
沸点
课程
数据标注
HOT
AI Coding
更多
直播
活动
APP
插件
直播
活动
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
登录
注册
MIT -6.006(2020 spring)
月弦音
创建于2024-02-28
订阅专栏
数学推导/证明+课堂代码 Talk is cheap , show me your code
暂无订阅
共13篇文章
创建于2024-02-28
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
MIT6.006 ——lec11
Weighted graphs: Different from the unweighted graph,the weighted graph's edge is weighted . In the
MIT6.006 lecture009
Graph Defination: Directed edges are ordered edges Undirected edges are unorded edges (i.e. (u,v) an
MIT6.006 lecture10
DFS & BFS: DFS different from BFS,it solves the problem about reachability.BFS is to find the shorte
MIT6.006 lecture008
Priority Queue Interface: Keep track of many items, quickly find the most important one. Order items
MIT6.006 lecture007
Height Balance: maintain the height of the tree is $O(logn)$ AVL Tree Rotations: Change the subtree'
MIT6.006 lecture06
Binary tree: def: pointer-based data structure,it has three pointers each node. representation: node
MIT 6.006 lecture005
Comparison Sort Lower Bound: Leaves$\ge$ possible outputs,height is lower bound$\Omega (logL)$,so wo
MIT 6.006 Problem session 2
1-2:Stone Searching In a infinite reange,try to find number k Solution: We want to usebinary search,
MIT 6.006 recitation04
DirectAccessArray: Any item x with key k will be stored in array index k. We can find an item in O(1
mit 6.006 recitation-003
A fast set: sorted array: In this data structure, we can find the item easility by the binary resear
mit 6.006 lecture-notes 003
Permutation Sort: For each permuatation, check each whether is orded Analysis: You will try all poss
Problem Session 1
Problen session: 1-2: (a) Code: (b): 1-4: 问题描述: 我们要将一个长度为2n的链表,分为两个长度为n的部分,但同时要保证后半段链表的“公平性”,因此便有了关键
Recitation- 002
Array sequence: set_at and get_at only need $O(1)$time,but delete and insert needs linear$O(n)$time.