Ch 4.2:Min Max problem | Divide and conquer | Algorithm lectures for GATE CSE by Monalisa Pradhan
In this lecture i discussed Min Max problem ,number of comparison needed ,Example ,Divide and conquer approach ,and solved one previous question.
GATE CSE 2007 | Question: 50
An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?
(A) At least 2n – c comparisons, for some constant c, are needed.
(B) At most 1.5n – 2 comparisons are needed.
(C) At least nLog2n comparisons are needed.
(D) None of the above.
Ans :(B) At most 1.5n – 2 comparisons are needed.
----------------------------------------------------
Subscribe my channel for more updates / monalisacs
----------------------------------------------------------
Join Telegram GATE CS study group: https://t.me/MonalisaCS
----------------------------------------------------------------
Algorithm Lectures : • Algorithm Lectures for GATE CSE by Monalis...
Algorithm GATE PYQ: • Algorithm GATE CS & DA PYQ(2010-2025) solv...
----------------------------------------------------------------
Compiler Design Lectures : • Ch 1.1:Language Processing System |CD Lect...
Compiler Design PYQ : • Ch 1.1:Language Processing System |CD Lect...
----------------------------------------------------------------------
Theory Of Computation Lectures • Video
TOC GATE PYQ: • GATE CS 2010,Q39:Let L={w ∈ (0 + 1)* | w h...
-------------------------------------------------------------------
Data Structure Lecture: • Data Structure Syllabus for GATE
Data Structure PYQ: • Data Structure Syllabus for GATE
-----------------------------------------------------------------------
#MinMaxProblem#GATE_CSE#Divideandconquer