79623103

Date: 2025-05-15 10:26:40
Score: 2.5
Natty:
Report link

Big-O notation describes the upper bound of an algorithm's running time in terms of input size .for example if the input size is n .
1.By understanding the code

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Uday kiriti