Question

why is Big-O notation used in analyzing Algorithms

Answer 1

Answer:

$\huge{\boxed{\boxed{\bigstar{\underline{\underline{\underline{\frak{\green{\bf{HELLO\: BUDDY}}}}}}}}}}$

$\huge{\boxed{\boxed{\bigstar{\underline{\underline{\underline{\frak{\green{\bf{YOUR\: ANSWER}}}}}}}}}}$

$\large{\boxed{\bigstar{\underline{\underline{\frak{\red{\bf{ANALYSING \: ALGORITHM}}}}}}}}$

$\large{\boxed{\bigstar{\underline{\underline{\frak{\red{\bf{=======>>>>>>}}}}}}}}$

$<font color="green">Algorithm Analysis with Big-O Notation. Big-O notation is a metrics used to find algorithm complexity. Basically, Big-O notation signifies the relationship between the input to the algorithm and the steps required to execute the algorithm.$

$<font color= "red"><marquee> HOPE IT HELPS YOU </marquee>$

$<font color ="green"><marquee>MARK BRAINLIEST </marquee>$