Interview Bootcamp
Vote

0% completed

​

An Overview of Big-O

Big-O notation is a mathematical notation that is used to describe the performance or complexity of an algorithm, specifically how long an algorithm takes to run as the input size grows. Understanding Big-O notation is essential for software engineers, as it allows them to analyze and compare the efficiency of different algorithms and make informed decisions about which one to use in a given situation. In this guide, we will cover the basics of Big-O notation and how to use it to analyze the performance of algorithms.

.....

.....

.....

Like the course? Get enrolled and start learning!
Gabriel Nava

Gabriel Nava

· 2 months ago

Am I crazy or is 2. Fibonacci sequence -  O(n) code is completely wrong? It looks the same as the code for 1.5

Show 1 reply
Chhangsreng P

Chhangsreng P

· 2 years ago

If you're reading this, you're probably someone from the future, Hello!

It's a surprise to see no one has been here yet, that's said. This course is fire. It's the best thing ever. I'm actually here due to another course "DSA pattern", but I see that this is a prerequisite. THat said, hope you do well in whatever you're trying to learn, I know you will!.

Reading Progress

0%

Vote for new content