Time complexity analysis: asymptotic notations - big oh, theta ,omega @mycodeschool

Time complexity analysis: asymptotic notations - big oh, theta ,omega @mycodeschool

Uploaded December 2012 | Updated September 2026, 2 weeks ago

See complete series on time complexity here
youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn
In this lesson we will introduce you to the concept of asymptotic notations in time complexity analysis of an algorithm.

Time complexity analysis: asymptotic notations - big oh, theta ,omega

Time complexity analysis - some general rules

Check for balanced parentheses using stack

Merge sort algorithm

Find min and max element in a binary search tree

Fibonacci Sequence - Recursion with memoization

Time complexity of a computer program

Exponentiation - Time Complexity analysis of recursion

Direction of a point from a line segment

Doubly Linked List - Implementation in C/C++

Area of polygon

Working with pointers

Time complexity analysis: asymptotic notations - big oh, theta ,omega