Answer:
An algorithm’s performance depends on the number of steps it takes. Computer Scientists have borrowed the term ‘Big-O Notation’ from the world of mathematics to accurately describe an algorithm’s efficiency. Many self-taught Developers and Data Scientists either settle for a solution that ‘just works’ without thinking how to improve their code’s performance, or go into optimising it without really understanding the basics. Their attempts are either fruitless or have very small, and mostly incidental, impact.
Explanation:
