2. Time Complexity Of Algorithms with Example - Best, Worst, Average Case Time Complexities |DAA|

[@karthikpk3618]

mam i have seen alot of videos of this topic but ur the only one i understand nice explanation mam

[@anony_mous-qj1fs]

this playlist is very useful for everyone please can u make important topics for jntuh exams point of view so that as we are having exams in august we can score weel because of ur content

[@priyadharshini.e7895]

Sis pls explain about Insertion and deletion and merging with 1) binary search tree, 2) AVL tree, 3) Red Black tree, 4) B tree, 5) B+ tree and Comparison of previous tree structures. Fibonacci Heap, Fibonacci Heap Operations: Find minimum, merge, insert, extract minimum, decrease key and delete, Complexity analysis of the above data structure operations. Greedy method: General method, applications-Job sequencing with deadlines, 0/1, knapsack problem, Huffman Codes, Dynamic Programming: General method, applications- Matrix chain multiplication, 0/1 knapsack problem, Traveling salesperson problem, Reliability design. Representations of Graphs, Minimum Spanning Trees: Growing a Minimum Spanning Tree - Kruskal and Prim- Single-Source Shortest Paths: The Bellman-Ford algorithm - Single-Source Shortest paths in Directed Acyclic Graphs - Dijkstra ‘s Algorithm, Divide t, Strassen’s matrix multiplication, External Sort: External merge sort, K-Way Merge sorting

[@S.Deepak-m8g]

A good explanation can be pass a student. You are a good teacher❤

[@aishasarkar6505]

@Trouble- Free , Correct me if i am wrong......When you explained about best,worst, and avearage time complexities you gave example where there are 3 algo and the one taking the least time will be termed as best and the most as worst and so on . I think the effecting factor is conditions like input etc where the algo remains same so the same algorithm for different inputs will perform the best case that is the least time taken and the worst case when it will take the most time for a given input.......Please do reply.

[@animeweeb-ff9vx]

Absolutely your statement is 100% right

[@RengaBhavanamSAARAAA]

Yeah, Ur thinking is correct, I too had the same question. And I Checked in google and find that Time Complexity is Affected By the Following Factors: 1)Input Size 2)Data Structure 3)Hardware 4)Algorithmic Strategy 5)Implementation 6)No.Of.Operations 7)Type Of Operations 8)Recursion and Nested Loops Mam initially told about "Algorithmic Strategy" but given an example from the factor "Input Size"

[@chinmay9975]

I am really Trouble Free, Thank You.

[@malavikarapelli8762]

Can you please continue this playlist

[@naveshiasultana574]

Mam can you continue this playlist

[@nishasharma6365]

Thnk u mam ur video is very help ful for. Our exam and topic easy understood. ...please continue ur playlist 😊🎉

[@255_BOSS]

great explanation

[@jagadishm9587]

Very well understood mam❤nice teaching

[@friendsitcom2312]

Ma'am your expectations is simple superb pls continue the playlist mam

[@Kakoli47]

Thank you ma'am 🥰

[@vsg6005]

Amazing💕😍 😘😘😘😘😘😘

[@Dabbikar--Rahul--Pailwan]

Your notes is clear and don't have mistakes 😂

[@Midlaj_Bejjavalli]

Nice ❤

[@MDeepakReddy]

Mam explain.frequency count

[@sreejith2848]

Mam please make a video about greedy method .

[@ShaikRizwana-m8v]

Thank u mam

[@Dilsa761]

Thanku

[@bhuvanjayachandranbabu8626]

But for searching same element may come under this rule, but you are taking different elements and telling us this is time complexity (for different elements)

[@SainathChakure]

❤

[@ahanasingh2279]

time complexity and time taken by an algo to execute are two different things.

[@maheshyadla3803]

We have exam on28 th 😢

[@thakurneha6540]

Mam can you send pdf of your notes

[@SoumyadipPal-xw3xz]

mam plz share this note

[@Dabbikar--Rahul--Pailwan]

Sis plz keep Daa notes 😅

[@deepthisamanthakurthi4020]

Mam explain this subject mam