Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Online Practice Test
>
Data Structure 1
« Previous
Next »
Which is the fastest sorting algorithm to sort a list?
Options
- Quick sort
- Bubble sort
- Binary sort
- Linear sort
CORRECT ANSWER : Quick sort
Discussion Board
Data Structure - Quick Sort
Quick Sort is generally considered to be the best sorting algorithm. It is a highly efficient sorting algorithm. Quick sort is the quickest comparison-based sorting algorithm. It is very fast and requires less additional space, only O(n log n) space is required.
Prajakta Pandit 02-1-2017 03:17 AM
sort speeds
A good library will have better sorts than most programmers have time to write. The merge sort is very good when memory is limited, and the selection sort performs better than a bubble sort.
Alex 11-16-2014 02:40 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
▲