Calculating Time complexity of a Polynomial Algorithm (Big O)

Watch all my playlist here:

Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.

The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -

1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.

The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...

#dsa #algorithms #coding

[priyamjain]

I have seen and went through many free DSA courses on YT which are ofc not much, but firstly i'm delighted to see one of such amazing DSA course on YT and most importantly the way you strucutred the complexity part is something i have not seen much with other courses and i understood that very easily .
Looking forward to this course.
Thanks alot sir !

[nareshkagollu]

I don't have clarity about time complexity till now. After watching your video all doubts are cleared.Thank you sir.

[karansinghi]

Best part about ur videos is the examples, which make it very easy for us to understand the topic, thanks for uploading such content in YT.

[venkatabhargav]

I am really great full and thank full for you Dinesh. After several attempts of understanding this Big O notation from many resources this is the first time I am able to understand this big o notation. Thanks a lot.

[shubhamagarwal]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over YouTube with java implementation and found this. Hats Off To You Man....Excellent Work. GOD BLESS YOU :)

[rishabhgarg]

Hello sir, I go through various free available courses on internet. But till now this is the best i have ever met on DSA.
I watched total 9 videos and found the best content on defining DSA and time complexity.

[JohnbelMahautiere]

Are polynomials applied in the management of Kubernetes pods, and if so, to what extent or degree should one consider deleting and recycling pods? Given that Kubernetes pods operate based on time and counter-based metrics, and also require adequate storage, the question arises: how is this necessary storage calculated? Specifically, how does Kubernetes apply polynomial functions, such as 2x³ + 3x² + x + 5, to the distribution of storage space? What methods or parameters are used in this calculation, and are there potential errors or uncertainties that may arise in such implementations?

[dineshr]

Thanks a lot Dinesh Varyani. This has helped me a lot.

[someshsahu]

Very nice explanation sir thankyou so much 🙏🏼🙏🏼🙏🏼

[satyagowridigudari]

How i++ executed 3n times ? it will execute only n

[abhishekanand]

ok completed till here and it's going nice. the best thing i found that u teach fast and cover what's imp. and talk only point to point.

[ericpatki]

Great videos. Thank you! Just curious, do we add OR multiply unit times taken by operations on each line in case of nested loops?

[piyushmishra]

Thanks for your great help....
thanks a lot

[tawfeeqreda]

Thanks for this great explorations. Is there any way to get the slides?

[sejalsaka]

Sir plz make a video on calculating logarithmic time complexity

[vijaykandala]

I think Logarithmic running time is missing in the series, hope you will add it soon to your series

[suvosstudio]

Can please explain time complexity for logarithimic algorithms?

[sathiyadev]

what about these O(log n), O(n log n), O(n ^ 1/2) ??

[harsharora]

sir you only taught us time complexity about bigO notation in these playlist and not about delta and omega notation, why?

[rehnumabano]

I can't understand 2, 3, 4 operation