Calculating Time complexity of a Linear 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

[GowreshLearning]

I had DS in my B.E and M.tech & now I am having 7+ years as a Test Automation Engineer, never in my life I thought I would learn DS & Algorithm in simple terms until I met you here.
Great Content & Thank you very much

[BabuDivitPatel]

I don't know why your channel is underrated. You are excellent at teaching.I found data structure and algorithms a tough nut to crack but after watching your lecture it's feel like a piece of cake., ,,Hats off to you

[seamusmoran]

I just want to say out of everything I have seen on YouTube for this course and it's various topics you are BY FAR the best teacher, simple, straightforward explanations with great examples. I am taking this class in the fall and this is helping me to become familiar with the concepts beforehand. Thank you.

[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 :)

[shubhambhopale]

For the first time I really understood the equivalent graphs to showcase the TC. Thank you for detailed explanation! Looking to learn more.

[SonuSharma-fzkj]

Being non IT background person, I felt I can't understand any longer this DSA, manily asymptotic notation, , But trust your 8 mins explanation made it almost clear.
you're a champ..!!

[nivetha]

Found a bst tutorial to learn ds and algorithms.. ur contribution is great

[harshadgandhale]

This is the best teacher to learn data structure👍

[akif]

These are some of best resources on DS. Thank you Dinesh.

[puzzlled]

gjb hi padaya he bro crystal clear....keep up the good work

[dineshr]

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

[arunkumargupta]

Definitely I am gonna share this videos to my colleges also. Please sir bring a series of vedios for interview of DS-Algo.

[haripriya]

You are Fantastic....Thank you so much for the

[bapanapallihemanth]

this was very easy and great explanation i've ever

[arkaprovoacharya]

Sir the return type of the method will be int

[vigneshv]

I am following you on both in LinkedIn and Youtube and following your recommendations and study materials with full dedication. I hope to crack GAMAM. Thank you for providing all the details!

[anubhavthakur]

But won't i++ take less time than i=i+1? isn't that the whole point of using incremental operators?

[АскербековаАдема]

Hello! May I ask you: why the number of operations for the second line is equal to 1? I thought that the declaration and assignment count as each one operation, totally giving us 2.

[osasferguson]

But for n = 3, int i will be assigned four times during the loop, why wasn't it given a unit of time of 1(n+1)?
where 1 is the unit of time of the assignment operation.

[avinashthakur]

Sir I have one doubt ....will line no 1
Public void findsum(intx) use any unit amount of time or not??