Home BCA/BTech JEE RAS RSCIT Blogs
Switch Language हिन्दी
BCA / B.Tech 6 min read

Algorithm of Time Complexity

Quick Summary & Key Takeaways

  • • Subject Focus: Data Structure Notes in English (BCA / B.Tech Syllabus)
  • • Core Topic: Algorithm of Time Complexity - General Topics
  • • Overview: Algorithm of Time Complexity in Data Structures: Time complexity is a measure of the time taken for the execution of an algorithm. It is usually repres...
  • • Key Concepts: Time complexity algorithms, Sorting searching dynamic Hindi, Programming greedy time,Time complexity algorithms, Sorting searching dynamic, Programming greedy time

Algorithm of Time Complexity in Data Structures:


Time complexity is a measure of the time taken for the execution of an algorithm. It is usually represented according to the size of the input and is expressed in Big O Notation. Here we will understand time complexity through an example of a simple algorithm.

Basic Rules of Time Complexity:
  • Worst Case: The situation in which the algorithm will take the most time.
  • Best Case: The situation in which the algorithm will take the least time.
  • Average Case: The average time of all possible situations.

Algorithm of Time Complexity:
Let's say we have the task of creating a Fibonacci Sequence for a number. The time complexity of a simple recursive algorithm for this is O(2^n). This means that for every function call, two more function calls are made, creating a binary tree-like structure. The number of nodes in this tree is close to 2^n.

Types of Time Complexity:
  • O(1) - Constant Time Complexity
  • O(n) - Linear Time Complexity
  • O(n^2) - Quadratic Time Complexity
  • O(log n) - Logarithmic Time Complexity

Frequently Asked Questions (FAQs)

Algorithm of Time Complexity in Data Structures: Time complexity is a measure of the time taken for the execution of an algorithm.
Understanding Algorithm of Time Complexity is fundamental to mastering Data Structure Notes in English. It covers crucial concepts, solved problems, and revision points essential for academic and entrance exam success.
You can read free solved examples, detailed explanations, and key formulas for Algorithm of Time Complexity directly on the NotesMedia website or by downloading the NotesMedia App.

In this Chapter

Algorithm of Time Complexity
Binary Tree Traversal (Data Structures)
Introduction to Data Structures
Linked List in Data Structures
Operations on a Linked List
Operations in Data Structures
Trees in Data Structures
Binary Trees in Data Structures
Full Binary Tree in Data Structures
Applications of Linked Lists
Main Uses of Linked List
Operations & Applications of Trees
Tree Algorithms
What is an Algorithm?
Memory Allocation in Data Structures
Operations & Applications of Memory Allocation
Expression Tree in Data Structures
Operations & Algorithms of Expression Trees
Applications of Expression Trees
Graphs in Data Structures
Pointers in Data Structures
Pointer Algorithms
Sorting in Data Structures
Searching in Data Structures
Searching Algorithms in Data Structures
Stacks in Data Structures
Stack Algorithms
Queues in Data Structures
Queue Algorithms
Arrays in Data Structures
Time Complexity
Space Complexity
Parameter and Argument Passing
Algorithm of Space Complexity