A sort which compares adjacent elements in a list and switches where necessary is

M

Mr. Dubey

🎓 Coach ⭐ 102.92K Points

📊 Data Structure and Algorithms (DSA)

Q. A sort which compares adjacent elements in a list and switches where necessary is

(A) insertion sort
(B) heap sort
(C) quick sort
(D) bubble sort

💬 Discuss

✅ Correct Answer: (D) bubble sort

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

323

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate