Finding maximum and minimum element using Divide and Conquer|| Time Complexity ||Algorithm | Example

preview_player
Показать описание
#divideandconquer #sudhakaratchala #DAA
Рекомендации по теме
Комментарии
Автор

how to thank this legend!! saving the lives of students day before exam!!

mdashrafhussain
Автор

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

cartoonworldd
Автор

Thank you sir you are teaching every concept in a cristal clear way ☺️

krishnasai
Автор

Thank you sir for explaining this concept in such a simple way 🙏

subhadip
Автор

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

--saikarthik
Автор

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

tejasmohanbhanushali
Автор

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...

amarnadhsurada
Автор

Sir in time complexity why cant we take just 2power k instead of 2 power k-1??

HarshaMW
Автор

Thank you sir it's was so helpful

arthvibess
Автор

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

Instant_Family_Hub
Автор

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...

tatagovind
Автор

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

Indrasai
Автор

Thank you so much for your great support 🙏🙏🙏🙏🙏

SwapnaMerikapudi-iqsi
Автор

Please make video on defective chessboard algorithm analysis

adikuppili
Автор

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!

IralaPraveen-kuzr
Автор

Hi sir, can you please upload linux operating system concepts

nandhucharan
Автор

sir in the third step of the algorithm we are dividing the list only one 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 ?

SriyaVanama
Автор

Sreen shot thiakovadiniki vilu lekunda chestunnaru sir konchem jargandi

venky
Автор

Sir please upload daa and computer networks atleast three to four videos per a week!

sanjaykotni
Автор

If groomed well, u may look like mohanlal

bhuvana
join shbcf.ru