Omega Notation ( Ω ) gives the best case complexity.
Big O Notation ( O ) gives the worst case complexity.
Theta Notation ( θ ) gives the average case complexity of an algorithm.
for detailed information, refer this
-
Notifications
You must be signed in to change notification settings - Fork 0
Shaleengovil25/Competitive-programming
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Coding Ninjas
Topics
strings
competitive-programming
backtracking
loops
standard-template-library
sorting-algorithms
problem-solving
searching-algorithms
number-theory
fuction
recursion-problem
advanced-data-structures
stl-algorithms
advanced-algorithms
recursion-basics
coding-ninjas
space-complexity-analysis
time-complexity-analysis
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published