Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Sorting1.1K+ articles

Tree909+ articles

Stack261+ articles

Analysis of Algorithms187+ articles

Merge Sort109+ articles

Quick Sort77+ articles

Inorder Traversal43+ articles

BubbleSort23+ articles

Complexity-analysis

21 posts

Difference Between Exponential and Polynomial Complexities

Last Updated: 23 July 2025

Understanding the computational complexity of algorithms is essential in computer science, as it helps determine the feasibility and efficiency of solutions to problems. T...read more

Analysis of Algorithms

Complexity-analysis

P vs NP Problems

Last Updated: 23 July 2025

In the world of computers and math, there's this puzzling question: Can every problem we quickly check be solved quickly too? We have two categories: P for problems with q...read more

Complexity-analysis

What is the difference between Auxiliary space and Space Complexity?

Last Updated: 06 December 2023

Space complexity and Auxiliary space are two of the most often confused and interchangeably used terms when talking about the space complexity of a certain algorithm:Auxil...read more

Analysis of Algorithms

Complexity-analysis

Time and Space Complexity Analysis of Tree Traversal Algorithms

Last Updated: 31 May 2023

Let us discuss the Time and Space complexity of different Tree Traversal techniques, such as Inorder Traversal, Preorder Traversal, Postorder Traversal, etc.Time Complexit...read more

Inorder Traversal

Preorder Traversal

PostOrder Traversal

Data Structures-Tree Traversals

Tree Traversals

Complexity-analysis

Time and Space Complexity Analysis of Merge Sort

Last Updated: 14 March 2024

The Time Complexity of Merge Sort is O(n log n) in both the average and worst cases. The space complexity of Merge sort is O(n).AspectComplexityTime ComplexityO(n log n)Sp...read more

article_image

Analysis of Algorithms

Complexity-analysis

Time and Space Complexity Analysis of Quick Sort

Last Updated: 23 July 2025

The time complexity of Quick Sort is O(n log n) on average case, but can become O(n^2) in the worst-case. The space complexity of Quick Sort in the best case is O(log n), ...read more

Complexity-analysis

Time and Space Complexity Analysis of Bubble Sort

Last Updated: 23 July 2025

The time complexity of Bubble Sort is O(n^2) in the worst-case scenario and the space complexity of Bubble sort is O(1). Bubble Sort only needs a constant amount of additi...read more

Complexity-analysis

Time and Space complexity analysis of Selection Sort

Last Updated: 23 July 2025

The Selection sort algorithm has a time complexity of O(n^2) and a space complexity of O(1) since it does not require any additional memory space apart from a temporary va...read more

Complexity-analysis

Step Count Method for Time Complexity Analysis

Last Updated: 23 July 2025

What is Time Complexity?Time Complexity is the amount of time taken by the algorithm to run. It measures the time taken to execute each statement of code in an algorithm.T...read more

Analysis of Algorithms

Technical Scripter

Technical Scripter 2022

Complexity-analysis

Why is the complexity of both BFS and DFS O(V+E)?

Last Updated: 23 July 2025

The complexity of both BFS and DFS are O(V+E) because every vertex (V) and every edge (E) is explored only once. In graph theory, two fundamental algorithms used for trave...read more

Analysis of Algorithms

Complexity-analysis

Why is deleting in a Singly Linked List O(1)?

Last Updated: 09 March 2023

How does deleting a node in Singly Linked List work?To delete a node from a linked list we need to break the link between that node and the one pointing to that node. Assu...read more

article_image

time complexity

Complexity-analysis

Potential Method in Amortized Analysis

Last Updated: 19 September 2022

What is Amortization?Consider that you are a company owner and that you require a vehicle. The automobile is priced at €10, 000. You'll have to spend €10, 000 if you decid...read more

article_image

Analysis of Algorithms

time complexity

Complexity-analysis

Time and Space Complexity analysis of Stack operations

Last Updated: 23 July 2025

What is Stack?Stack is a linear data structure that follows a particular order in which the elements are inserted and deleted. A stack follows the principle of last in fir...read more

Complexity-analysis

Time and Space Complexity Analysis of Queue operations

Last Updated: 23 July 2025

What is Queue?Queue is a linear data structure that follows FIFO approach (First In First Out). One can imagine a queue as a line of people waiting in sequential order whi...read more

Complexity-analysis

Can Run Time Complexity of a comparison-based sorting algorithm be less than N logN?

Last Updated: 23 July 2025

Sorting algorithms are the means to sort a given set of data in an order according to the requirement of the user. They are primarily used to sort data in an increasing or...read more

Complexity-analysis