Analysis of Algorithm to find Maximum and Minimum element from an Array - Part 2

preview_player
Показать описание
This video solve the given problem with divide and conquer approach and analyze the time complexity of the same.
Рекомендации по теме
Комментарии
Автор

Thanku sir
Just want to mention
Last two if conditions are
If(max<max1) then max=max1;
If(min>min1) then min=min1;

venkateshbelgaonkar
Автор

Nice, simple explanation. However, the algorithm was correct from the start, the corrections made at 16:20 were not required.

tad
Автор

lots of adds in between creates a disturbance.

vidurbhardwaj
Автор

in which scenario we use add.scoped or add.transient??

gkmishra