data structure二叉搜索树二叉搜索树是一个满足以下性质的二叉树 对于任何结点$x$, 其左子树中的关键字最大不超过$x.key$, 其右子树中的关键字最小不低于$x.key$. 不同的二叉搜索树可以代表同一组值的集合, 大部分搜索树的最坏运行时间与树的高度成正比 遍历先序遍历(pre ...

reference: UCL Course on RL lecture 6 Value Function ApproximationIntroductionLarge-Scale Reinforcement LearningReinforcement learning can be used ...

Several pseudo-code for sort algorithmbubble sortworst time complexity: $O(n^2)$best time complexity $O(n)$average time complexity $O(n^2)$additional ...

reference: UCL Course on RL lecture 5: Model-Free ControlIntroductionOptimise the value function of an unknown MDP Model-free control can solve the ...

reference: UCL Course on RL Lecture 4 Model-Free PredictionEstimate the value function of an unknown MDP Monte-Carlo Reinforcement learning MC meth ...

reference: UCL Course on RL lecture 3 Planning by Dynamic ProgrammingintroductionDefinition Dynamic: sequential or temporal component to the proble ...

reference: UCL Course on RL lecture 1 Introduction to Reinforcement Learningreinforcement learning feature no supervisor, only a reward signal del ...

reference: UCL Course on RL lecture 2 Markov decision ProcessesMDP formally describe an environment for RL, where the environment is fully observab ...

这里记录一些快捷键Ubuntu的快捷键alt+F7 : 移动窗口alt+F9 : 最小化窗口alt+F10: 最大化窗口 vim快捷键help模式下Ctrl+] 跳转到链接位置Ctrl+t 返回上次的页面

Linux下使用R运行linux下的R脚本编写R文件 新建后缀名为R的文件 写入R程序 在脚本首行加入1#!/usr/bin/Rscript 运行R文件这里有两种方式 进入R的环境运行文件1> source('test.R') 注意到在R的环境里面运行脚本，可以保持变量仍然处于环境中 直接 ...