Awesome.. you make everything easy to understand sir. Thank you

Ultimately explaining big(o) ♥️🔥🔥

one of the best explanations i've ever seen

Thank you for your explanation on finding the Time complexity Sir... this is fitting inside my head without any doubts... Keep uploading the videos daily

Thank you very much for your DSA tutorial sir 🙏🙏

Ex-ordinary teaching sir👏

Thank you so much sir for your DSA tutorials. Sir please upload the remaining DSA tutorials also. It will be really helpful to learn the remaining lectures. Thank you sir.

Very good explanation Sir, can you please upload videos on remaining topics in DSA.

i have chosen you today to be my best tutor

Thank you Soo much Sir❤❤

Good Explanation Sir..😎😎

Thank you Sir.

Amazing

Thanks

Sir please Upload the remaining DSA videos it helps me to understand the concepts sir.

Please continue the series 🙏

hi @Telusko thanks for good explanation i would be greet if you could make PYTHON instead of JAVA

Nice

waiting for complete playlist

Binary search is only for sorted collection?

Best

Very good explanations sir. I have a doubt "your Binary search algorithm will work only if the list elements are in ascending order, Is my understanding correct?"

@krishnar754

6 ай бұрын

Yes that's correct!! For binary search algorithm to be implemented, we need to have the array sorted. If not sorted then we cannot implement binary search.

@pratikavhad489

2 ай бұрын

I also have the same doubt. What should we do or which algorithm we have to use if the elements are not in ascending order?

❤❤❤

Can you take fastapi classes?

Plz When are you Continue the Series you tell that you will continue this in the 1 week of sep?

@Telusko

8 ай бұрын

series will resume from tomorrow, recording already started

@MaazKhan-tn2wb

8 ай бұрын

@@Telusko Thank you Sir Love From Pakistan

no more videos on dsa ??

Very nice sir... But to understand java for other language students is little bit complicated

@Telusko

10 ай бұрын

Python implementation video is on the way

@aliksargsyan2782

10 ай бұрын

choose hard way not easy way, who run over easy way they will never get high level success in life. Remember that

@mentalismfast6156

10 ай бұрын

​​@@Teluskojava is enough do more topics other than the language seperation

dsa bnao depth m 400q

didn't understand binary search because you were not defining the pointer after changing the position. I had to follow the other resources to understand this concept.

can you please provide a source code..... please sir

public class Program { public static void Main() { int[] arr = new int[] { 1,2,4,5,8,13,17,18,21}; int a = 17; int count=0; //Console.WriteLine(arr.Length); for(int i=0;i