Asymptotic Notation || DSA || Bangla Lecture

Asymptotic notations are the mathematical notations used to describe the running time of an algorithm when the input tends towards a particular value or a limiting value.

There are mainly three asymptotic notations:
1. Big-O notation (O-notation)
2. Big Omega notation (Ω-notation)
3. Theta notation (Θ-notation)

#StickyNotesEngg  #Data_Struct_Algo  #SN_DSA

• #education
• #sticky_notes
• #lecture_in_bangla
• #sticky_notes_dsa
• #sticky_notes_engg
• #data_structure_and_algorithm
• #asymptotic_notations
• #asymptotic_analysis
• #algorithm_asymptotic_analysis
• #asymptotic_notation_in_data_structure
• #asymptotic_notation_big_o
• #asymptotic_notation_examples
• #big_o
• #little_o_notation
• #big_o_notation
• #big_oh_notation
• #big_omega
• #little_omega_notation
• #big_omega_notation
• #theta_notation
• #big_o_vs_big_omega_vs_big_theta
• #big_o_big_theta_big_omega_examples