MCQ Buddy
Search here...
Home MCQ Feed Add Question Programming Portal English Portal Login
  1. Home
  2. Engineering
  3. Design and Analysis of Algorithms
  4. Question

M

Mr. Dubey • 60.51K Points
Coach

Q. What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?

(A) 0
(B) 1
(C) 2
(D) 3
  • Correct Answer - Option(C)
  • Views: 494
  • Filed under category Design and Analysis of Algorithms
Share

Explanation by: Mr. Dubey
 the first swap takes place between 1 and 5. the second swap takes place between 3 and 2 which sorts our array.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. The user bhojas logged in and performed the following sequence of command. What will be the output of the last command? $ cd project/module1 $ pwd

Q. What data type should you choose for a zip code field in a table?

Q. _________ defined as a collection of program statements with four basic attribute i.e. input and output, function, mechanics and internal data

Q. What is planning?

Q. Secure shell (SSH) network protocol is used for __________

Q. The scale to measure the intensity level of sound is called

Q. If exec is called immediately after forking

Q. A way to ensure that the entity is indeed what it claims to be.-

Q. Spiral model is

Q. In the figure given below, the points N1 and N2 are known as_______


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Share in MCQ Buddy Groups

Share
Embed
Important Links
  • Browse All Categories
  • Subjects
  • Exams
  • Mock Test
  • Advance Search
  • Quiz
  • Duo Test
  • English Topics
Explore More Portals
  • Hindi
  • State wise Portals
  • MCQ Buddy Lab
  • Engineering
  • Programming Portal
  • MB Shorts
  • NCERT Portal
  • Faculties Portal
  • Groups
  • Q & A
  • Spaces
  • Satya Sanatan
  • Keycrypt
Who we are?

We are nothing if we are alone. But we have a huge community of students who are helping you getting good study stuff free.

More Links
  • Download App
  • Advertise with us
  • Contact us
  • Youtube
  • Terms & Conditions
  • Refund Policy
  • Privacy Policy

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger