hello sir this is karthik sir really your expressions and teaching is very excellent nice teaching with right notes understanding very well sir good job sir thankyou sir
you are so hardworking sir we can see your hardwork through your videos. They are great. you are a very good teacher. Thankyou for making such informative videos and making difficult topics easy for us
from main function. This is not program. It's an algorithm only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir one doubt, my maam as take LOGn in the time complexity problem but u haven't taken LOGn anywhere in the time complexity, is it Nessesary to take it or just leave it sir
sir at the time of writing recurrence formulae why you 2(power)k-1, could you explain please. instead of writing i=1 to k-1 we can write i= 1 to k if we take k=3. Hoping a detailed Answer!
Sir board is not visible when u r front Of it. If possible avoid it, it is useful for me to take screen shot. This is my advice to u sir,if any mistack plz sorry...
sir in the third step of the algorithm we are dividing the list only one time.....but sometimes whenever the list is big we have to divide the list so many times....then how can we repeat the process... is it right to use for loop ?
In Divide and conquer algorithms we must use recursion. Recursion means we always have to use conditional control statements, that is loops can't be used. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Ya sure. I will continue to upload more videos on linux programming.Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
In c language, / will give a quotient. Both are integers, so the result is also an integer. The result is 1 only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
how to thank this legend!! saving the lives of students day before exam!!
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
For next generation students ask to me who is the best teacher you seen in your life.? without thinking i will say this legend name
so nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
This guy deserves a medal 🏅❤️
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
@@SudhakarAtchala done sir you deserve a lot sir May Almighty bless you with good health always ❤️💯
Thank you sir you are teaching every concept in a cristal clear way ☺️
You're most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
hello sir this is karthik
sir really your expressions and teaching is very excellent nice teaching with right notes
understanding very well sir
good job sir
thankyou sir
Keep watching. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you sir for explaining this concept in such a simple way 🙏
It's my pleasure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
you are so hardworking sir we can see your hardwork through your videos. They are great. you are a very good teacher. Thankyou for making such informative videos and making difficult topics easy for us
So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
awsome sir super of youtube teacher
Sir in time complexity why cant we take just 2power k instead of 2 power k-1??
Super sir mind blowing teaching sir
Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Finally i understand. Thanks❤️
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Excellent explanation sir
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Thank you sir for give clear idea
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
What a brave teacher! Aww!
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Thank you sir it's was so helpful
Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sure
We are very thankful sir ❤️
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you sir 😌
Welcome 😊 Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you so much for your great support 🙏🙏🙏🙏🙏
You are most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Sir, how did you get min1 and max1 values from?? min and max are stored using arrays but how did you got min1 and max1? please clarify my doubt...
from main function. This is not program. It's an algorithm only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir one doubt, my maam as take LOGn in the time complexity problem but u haven't taken LOGn anywhere in the time complexity, is it Nessesary to take it or just leave it sir
Thankyou so much sir
Welcome. Please like the video, and share it with your friends. Thanks in advance.
Sir 15:24 should we have mention else block also in combine step? and we should return the min,max value in last cases.am i correct sir
Yes. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
in this vidoe sir pls move side sir
sir is this merge sort
no. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
sir at the time of writing recurrence formulae why you 2(power)k-1, could you explain please.
instead of writing i=1 to k-1 we can write i= 1 to k if we take k=3.
Hoping a detailed Answer!
you can write k also, no problem. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Please make video on defective chessboard algorithm analysis
Ya sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
life saver 😘
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Tq so much sir 🤩
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Nice explanation sir worth watching ur video 🫠🫠
Thanks. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
Sir board is not visible when u r front
Of it.
If possible avoid it, it is useful for me to take screen shot.
This is my advice to u sir,if any mistack plz sorry...
K sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
thank you, sir.
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
sir in the third step of the algorithm we are dividing the list only one time.....but sometimes whenever the list is big we have to divide the list so many times....then how can we repeat the process... is it right to use for loop ?
In Divide and conquer algorithms we must use recursion. Recursion means we always have to use conditional control statements, that is loops can't be used.
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
thank you sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Hi sir ,can you please upload linux operating system concepts
Ya sure. I will continue to upload more videos on linux programming.Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Is this recursive algorithm sir?
Yes. D & C means recursive alg only.
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thanks sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Valuable
Ya. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
sir, which book do you refer?
Sahani. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sreen shot thiakovadiniki vilu lekunda chestunnaru sir konchem jargandi
K. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir please upload daa and computer networks atleast three to four videos per a week!
K.
@@SudhakarAtchala thank you so much sir😊
Midi ee ooru sir
Guntur
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
If groomed well, u may look like mohanlal
Thanks for ur complement. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Already done sir👍
3/2 is not 1
In c language, / will give a quotient. Both are integers, so the result is also an integer. The result is 1 only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.