Question:
Which sorting algorithm works by continuously swapping the adjacent elements ?
Which sorting algorithm works by continuously swapping the adjacent elements ?
Updated On: Apr 19, 2024
- INSERTION SORT
- SELECTION SORT
- BUBBLE SORT
- QUICK SORT
Hide Solution
Verified By Collegedunia
The Correct Option is C
Solution and Explanation
The correct option is(C): BUBBLE SORT
Was this answer helpful?
0
0
Top Questions on Sorting
- __________ compares neighboring elements only and swaps them when necessary?
- What will be the result after pass 2 using Bubble Sort, if we are sorting elements in ascending order?
Initial List: 7 19 18 9 23 51 12 54 73 - If a list contains ’n’ number of elements and all the elements are by default sorted in ascending order, how many comparisons will be required during 1st pass of bubble sort to arrange the list in ascending order?
- What is the number of passes made by bubble sort for a list containing n elements ?
- Which statement is incorrect in relation to searching an element in a list :
View More Questions
Questions Asked in CUET exam
- If 1st March 2023 was a Wednesday, what day of the week was 1st March 2024?
- CUET (UG) - 2025
- Clock and Calendar
- Which region was known as the ‘nursery of the Bengal Army’ as many sepoys were recruited from there?
- CUET (UG) - 2025
- British Empire
- A shopkeeper increases the price of an article by 25% and then offers a discount of 20%. What is the net percentage change in the price?
- CUET (UG) - 2025
- Percentage
- In a certain code, WATER is written as YCVGT. How is HOUSE written?
- CUET (UG) - 2025
- Coding Decoding
- A person walks 10 m North, then turns right and walks 5 m, then turns right again and walks 10 m. What direction is he facing now?
- CUET (UG) - 2025
- Direction sense
View More Questions