Min Max Algorithm [Hindi] | DAA | Example 1

preview_player
Показать описание
Minimum and Maximum algorithm from topic Divide and Conquer Approach in Design and analysis of algorithm. Video tells basics of Minimum and Maximum algorithm and tell how to Draw Min Max Tree along with Algorithm and Complexity.

Share this video:

#easyengineeringstudies #MinMaxAlgorithm #DAA
#DivideandConquerApproach #MinimumandMaximumalgorithm
Рекомендации по теме
Комментарии
Автор

You solved the problem in the first statement itself. The problem is TO FIND min and max, how can we (the compiler) know the min and max in the first step! Even if it does, why were you solving further :P

mohit
Автор

Awesome...what an easy method... Our books had very confusing method..You made it very easy..keep it up Sir. ..

anilshivankar
Автор

Kal hamara exam h or yaha video mere liye kafi helpful hua Dhanyawad Sir 🙏

codexvibe
Автор

Explore more content from this channel and
Give your support by subscribing and sharing with your frnds

EasyEngineeringStudies
Автор

the time complexity of max-min algorithm is O(n) not O(log n).
space complexity is O(1).

vivanvatsa
Автор

I think enginnering students know which one is greater in -8 and -5.

himanshupatidar
Автор

but how do we get finally minimum and max element

jyotigaikwad
Автор

Nice explaination...Thanks sir I really understood now..

swapnil
Автор

can you upload algorithm videos on competitive programming syllabus..

ashishsinha
join shbcf.ru