Data Structures - What are the various kinds of sorting techniques? Which is has least worst case?

GeekInterview.com > Interview Questions > Concepts > Data Structures

Go To First | Previous Question | Next Question

Data Structures | Question 174 of 202

What are the various kinds of sorting techniques? Which is has least worst case?

These are some sorting techs,

bubble sort
quick sort
insertion sort
selection sort
merge sort
heap sort

tell me any more sorting is found..... ad which is best....

Total Answers and Comments: 6

Last Update: October 23, 2009 Asked by: mikerich135

Sponsored Links

Best Rated Answer

—

Submitted by: sunils34

There are a few other sorting algorithms which are distribution based algorithms. Examples of these are Bucket Sort, Counting Sort, and Radix sort which can operate O(n) depending on the the input.

Above answer was rated as good by the following members:
appu502

November 06, 2007 01:31:41

ratheeshnellikkal

RE: What are the various kinds of sorting techniques? ...

among the sorting algorithms quick sort is the best one

Is this answer useful? Yes | No

December 28, 2007 01:42:59

manishmodgil

Member Since: July 2006 Contribution: 15

RE: What are the various kinds of sorting techniques? Which is has least worst case?

Sorting techniques

Bubble sort
Selection sort
Insertion sort
Quick Sort
Heap Sort
Bucket Sort
Hashing technique.
BST could be classified as a sorting technique.

The best sorting technique for a particular problem largely depends upon the problem at hand ( domain and size of the problem ) and the resources available ( memory CPU and time ).

Heap sort has the least worst case complexity.

Is this answer useful? Yes | No

0 1

Overall Rating: -1

January 20, 2008 19:38:07

sunils34

Member Since: January 2008 Contribution: 1

RE: What are the various kinds of sorting techniques? Which is has least worst case?

There are a few other sorting algorithms which are distribution based algorithms. Examples of these are Bucket Sort Counting Sort and Radix sort which can operate O(n) depending on the the input.

Is this answer useful? Yes | No

1 0

Overall Rating: +1

January 21, 2008 08:56:54

anjali9477

Member Since: January 2008 Contribution: 1

RE: What are the various kinds of sorting techniques? Which is has least worst case?

There are various Sorting techniques
They are Internal and External Sorting.
Various Internal sorting tecniques are as follows:
Bubble sort
Insertion sort
Selection sort
Quick sort
Merge sort
Heap sort
Radix sort
bucket sort
Shell sort

For small input size shell sort is best choice

Is this answer useful? Yes | No

0 1

Overall Rating: -1

August 16, 2009 22:58:25

rohini.nitd

Member Since: August 2008 Contribution: 5

RE: What are the various kinds of sorting techniques? Which is has least worst case?

Shell Sort Radix Sort

The complexity is depend on the given data

If it is in sorted order insertion sort is best one and quick is worst

If not quick shows good results etc.

So it is just depend on the order of given data

Is this answer useful? Yes | No

October 23, 2009 02:29:48

vinod148

Member Since: April 2008 Contribution: 6

RE: What are the various kinds of sorting techniques? Which is has least worst case?

HEAP sort is the best algorithm

O(n log n) time for best avg and worst case
O(1) space

let me know if any other sorting algorithm present if that exceeds the limit i gave

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank