mimimum no of comparison

Question

Minimum no of comparison to find minimum element out of n elements.

Comments

if we use heap then it is O(1) otherwise we will have to apply linear search on array which takes O(n)

---

i m talking about exact number not asymptotic.

Answer 1

Minimum no of comparison to find minimum element out of n elements is N-1

Comments

@shubham we have an algorithm for finding both min-max for n elements rec relation is
T(n)=2T(n/2) +2 nd we need 3ceil(n/2)-2 comparison in worst case.
so if we ll use above algorithm to find only minimum element we can use modified min-max DAC algorithm for this .that have recurrence relation of
T(n)=2T(n/2)+1   ??m i right ??

---

i understand your dout

pls watch this

https://www.youtube.com/watch?v=lEvzwEcjQ54&list=WL&index=63

---

ok i got it actually rec relation T(n)=2T(n/2)+1 also gives n-1 comparison .it does not help 2 reduce no of comparison .