Computer Science, asked by phanikumark446, 1 day ago

3._ Among the following sorting algorithms, which one needs the minimug number of swaps? A Selection sort B. Quick sort C. Heap sort D. Insertion sort

Answers

Answered by deamonslayer10

0

Answer:

Among the following sorting algorithms, Ans is A

Answered by lukendrimajhi

0

Answer:

A selection sort

Explanation:

Selection sort is an in-place algorthm have minimug number of swap

Previous Question

Next Question

Similar questions

Hindi, 14 hours ago

1- ‘जब मुझे बहुत डर लगा था……’ ‘मैं जब छोटा था……’ इस शीर्षक से जुड़े किसी अनुभव का वर्णन करो।...

Geography, 14 hours ago

what is photography ?.

Hindi, 14 hours ago

Bela's mind became very bad, Matasab might have beaten me but not in front of Sahil. She felt ashamed of herself in front of Sahil because she knew that she was very good in Sahil's eyes. When she came and sat next to him, she could not see him. Sahil and Bela talk about this incident on their way home from school. Write the possible conversation between Sahil and Bela.class 10 in answer in hindi...

Math, 1 day ago

∆V is 120° in interior ∆W is 100° in exterior ∆X is x in exterior, ∆Y is 100° in exterior ,∆Z is 55° in exterior, find x...

Social Sciences, 1 day ago

Briefly explain the liberation movement of South America.

Math, 8 months ago

Mr. Verma, got a 20% increase in his salary and his new salary is Rs 1,50,000. Find his original salary.

Environmental Sciences, 8 months ago

Speach on responsibility towards environment...

Math, 8 months ago

If 88x+36y=-92,36x+88x=-404.....then...