Big O Cheatsheet Complexity Efficiency of stacks, queues, linked lists, doubly linked lists, and more data structures when inserting, deleting and searching Big O notation is defined by Wikipedia as a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is a member of a family of notations invented by Paul Bachmann, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation.
I use since some years Hugo as my static site generator. I like it a lot, it is fast, reliable, open source, with an amazing community and works perfectly well. After you setup the site, you just create content, make the new content and upload it to your server. You make the content available to the site with hugo , you serve the content to test it locally with hugo server, then you need to deploy the site.
Once again I’m making a new blog. The previous ‘New blog’ blog was about two years ago. In the middle many adventures, ideas, books, conferences, code, gadgets and other stuff of my interest happened. Now, new blog, using the same static generator written in Go as before, to create it ( Hugo ), with new theme and some ideas. I hope in this brand new ‘New blog’ I could reach what I would like to complete now.
Some days ago, I was reading Guido Van Rossum’s Google Plus Page, and I found a link that he shared under this description «I was so impressed with this I am posting it to G+ and tweeting it «. As I admire a lot this guy, because he is the creator of the greatest programming language ever existed, I inmediately opened it. The story is about the things and warnings you should know before you start programming, under the title; Things I Wish Someone Had Told Me When I Was Learning How to Code.