What's big O notation?

Question

Simplified version of algorithm? How do we use it in programming? What're its benefits?

Answer 1

• https://www.sololearn.com/learn/6362/?ref=app
• https://code.sololearn.com/WS8SBRFRVxcn/?ref=app

Monjo Check out this:
• https://www.sololearn.com/post/56971/?ref=app

➝ Remember to use  🔍SEARCH. . .  bar to avoid from posting duplicate threads!
• https://www.sololearn.com/Discuss/1651177/?ref=app
• https://www.sololearn.com/Discuss/1710597/?ref=app
• https://www.sololearn.com/Discuss/1254924/?ref=app

Answer 2

A notation used to denote the complexity of an algorithm. The O usually stands for "order of".

Answer 3

Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.
This link helped me when i learnt it
https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
Good luck ❤😁

Answer 4

Thank you guys ❤️