CSE GATE 2007 Question No 50 Algorithms

Question No. 50 CSE | GATE 2007

An array 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 nlog₂n comparisons are needed.
(D) None of the above.

Answer : (D) None of the above.

GATE 2007 CSE Algorithms Sorting

Comments

xSZPaT http://pills2sale.com/ levitra nizagara

Posted on 18/10/2020 14:24:22 by dobsonz

av8oUg https://www.quora.com/What-the-top-SEO-keywords-for-essay-you-know/answer/Alan-Smith-1772 write my essay

Posted on 04/12/2020 01:25:43 by dobson

yLLhaK http://xnxx.in.net/ xnxx videos

Posted on 12/12/2020 21:48:52 by johnan

Efczgu https://writemyessayforme.web.fc2.com/

Posted on 13/12/2020 04:05:25 by dobson

LeC0GY https://writemyessayforme.web.fc2.com/#writemyessay

Posted on 15/12/2020 05:05:53 by dobson

uC1xl6 https://writemyessayforme.web.fc2.com/octavio-paz-essay-day-of-the-dead.html

Posted on 09/01/2021 09:24:35 by dobson

OT7CmN http://waldorfdollshop.us/ waldorf doll

Posted on 09/01/2021 13:39:15 by johnanz

oCz41R http://nexus.cct.lsu.edu:8000/nexus_uis/930

Posted on 17/01/2021 10:50:50 by johnanz

GATE Papers >> CSE >> 2007 >> Question No 50

Answer : (D) None of the above.

Questions of Sorting

About

Follow Us On

Contact Us

Search in Website