Time Complexyity is growth trend of algorithm running time as data size becomes larger.
We denote the input data size as $n$. We also denote the number of operations as the function $T(n)$, the time complexity as $O(n)$ and this mathematical notation is called “Big-$O$ Notation”, which stands for the “asymptotic upper bound” of the function $T(n)$.
Hexo is a fast, simple & powerful blog framework which can help us to generate the static files of blog and deploy the sites. The reason why I choose Hexo is only NexT theme of Hexo.
I use GitHub to manage all the articles of my blog and regard it as a Cloud Drive to sync files.
The reasons why I choose Netlify are:
hexo generate and hexo deploy. I only need to git push my articles to my repo on GitHub.Alternatively, you can also choose GitHub Pages (Maybe I will move my blog to GitHub Pages in the future).
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.