首页
首页
AI Coding
NEW
沸点
课程
直播
活动
AI刷题
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
会员
登录
注册
数据结构与算法
littleCat
创建于2023-02-27
订阅专栏
源码中用到的数据结构 基础算法
暂无订阅
共9篇文章
创建于2023-02-27
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
平衡查找树
avl 左右子树的高度差小于等于 1。 其每一个子树均为平衡二叉树。 为了计算平衡因子,我们要在节点中引入高度这一属性。在这里,我们把节点的高度定义为其左右子树的高度的最大值。 红黑树 Red-Bla
排序算法-quicksort
intro Quicksort is popular because it is not difficult to implement, works well for a variety of dif
排序算法-Mergesort
intro divide-and-conquer Mergesort is based on a simple operation known as merging: combining two or
排序算法-Elementary Sorts
Selection sort 每次遍历都要向后比较到最后一位 complexity Selection sort uses ~N2/2 compares and N exchanges to sort
heap 题收录
Sort a nearly sorted (or K sorted) array https://www.geeksforgeeks.org/nearly-sorted-algorithm/ Give
Applications of Heap Data Structure
Priority Queues: Heaps are commonly used to implement priority queues, where elements with higher pr
Treap
Treap is a Cartesian tree of (key,priority) pairs;it is heap-ordered according to the priority value
Cartesian Tree
A RMQ on a sequence is equivalent to a lowest common ancestor query on the sequence’s Cartesian tree
redblack tree vs avl
rb trees provide faster insertion and removal operations than AVL trees