Home/ Questions/Q 8376865
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-09T15:31:42+00:00

I’ve read about algorithm run-time in some algorithm books, where it’s expressed as, O(n)

  • 0

I’ve read about algorithm run-time in some algorithm books, where it’s expressed as, O(n). For eg., the given code would run in O(n) time for the best case & O(n3) for the worst case. What does it mean & how does one calculate it for their own code? Is it like linear time , and is it like each predefined library function has their own run-time which should be kept in mind before calling it? Thanks…

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    A Beginner’s Guide to Big O Notation might be a good place to start:

    http://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/

    also take a look at Wikipedia

    http://en.wikipedia.org/wiki/Big_O_notation

    there are several related questions and good answers on stackoverflow

    What is a plain English explanation of "Big O" notation?

    and

    Big-O for Eight Year Olds?

    • 0