Home » Interview Questions » Interview Question | Software Engineer | What is Big-O notation?

You are expected to demonstrate essential understanding about Big-O notation and how it analyses the complexity of an algorithm. The question may also get accompanied by a given operation to which you will have to identify which category of performance/ complexity classes the operation falls into.

The answer must define big-O notation. Big-O notation is used in computer science to describe the performance or complexity of an algorithm. It describes how the runtime or space requirement of a function grows as the input grows. The following are the complexity classes:

  • Constant-time
  • Logarithmic
  • Linear
  • Polynomial
  • Exponential
  • Factorial

Leave a Reply

Your email address will not be published. Required fields are marked *

*
*

Latest

You need someone on your team who will work across value streams and programs to help provide the strategic technical direction that can optimize portfolio outcomes. What portfolio-level must you fill?
Who is responsible for managing the Portfolio Kanban?
What portfolio-level role takes responsibility for coordinating portfolio Epics through the Portfolio Kanban system?
Which role accepts Capabilities as complete?
Who is responsible for the Solution Backlog?
Exit mobile version