Big-O: Time and Space Complexity Analisys Definition The Big-O notation provides us the information of how fast a given algorithm is. It allows us to compare the number of operations and informs us of how quickly the algorithm grows. This particular way of measuring the runtime of an algorithm takes into account the worst case, i.e. in the worst possible scenario we can be sure that an algorithm performance won’t be worse than its Big-O notation.…

Hello, this is my first post, hopefully this time I got it right (not proud to admit that I struggled quite a bit)! I’ll be posting mostly about my learnings on software engineering in general, possibly some personal opinions and the occasional rant. Anyway, just a regular blog, if it happens to be of help to someone, awesome! Otherwise, it will entertain me (for some time).…