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 ).

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.

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

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

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

bubble sort

quick sort

insertion sort

selection sort

merge sort

heap sort

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

mikerich135Profile Answers by mikerich135 Questions by mikerich135

Questions by mikerich135 answers by mikerich135

## Answer Question

Click here to Login / Register your free account

## Related Answered Questions

## Related Open Questions