Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Online Practice Test
>
Data Structure 3
« Previous
Next »
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?
Options
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
CORRECT ANSWER : Bubble Sort
Discussion Board
ANSWER IS WRONG
The most suitable sorting method for sorting a list which is almost sorted is insertion sort
BRIJESH KUMAR 05-11-2024 01:52 AM
Data Structure - Bubble Sort
Bubble sort would be most suitable for sorting a list which is almost sorted. Bubble sort is a type of sorting. It is used for sorting 'n' (number of items) elements. It compares all the elements one by one and sorts them based on their values.
Prajakta Pandit 02-1-2017 07:04 AM
« Previous
Next »
Write your comments
*
*
Email must be in the form someone@domain.com
*
*
Enter the code shown above:
Please enter the code shown above
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
Related Content
C test (42)
C (12)
C++ for beginners (10)
C++ (20)
C++ (24)
C++ (18)
C++ (14)
C++ (12)
C++ (15)
C++ (15)
Data structure (20)
Data structure (10)
Data structure (10)
Data structure (10)
PERL (25)
VC++ (11)
Oops (30)
Mainframe (41)
Mainframe (15)
Embedded systems (15)
OOAD (49)
Advertisement
▲