• Home
  • Asymptotic Notations With Examples

This page contains detailed tutorials on Asymptotic Notations (Asymptotic Notations in Algorithms and Data structures), The efficiency of an algorithm depends on the amount of time, storage and other resources needed to execute the algorithm. An algorithm may not have the same performance for various input kinds. The study of performance change of the algorithm with the change in the order of input size is called asymptotic analysis. In this tutorial you will learn about the big-o notation, theta or Omega notation. The efficiency is measured using asymptotic notations. The efficiency of a given algorithm can be checked using these notations.