Yes Bubble sort is the least efficient algorithm available.
However, for small data sets it doesnt matter much what sorting algorithm u use. And bubble sort does have a few good qualities. Apart from being the simplest and the easiest of the sorting algorithms it knows when the data set is already sorted(just a slight modification) making it ideal for sorted or nearly sorted data items(along with insertion sort).

in bubble sort one has to compare 1 st element with the second,then second element with the third and son on.it will be better to use bubble sort if number of elements to be sorted are few.

Bubble sort is an sorting algorithm, where every element in the unsorted list, is compared with every other element to make a sorted list. All these comparisons add up to the overall time complexity of the algorithm to be O(n) if n is the input size, which is really high compared to other popular algorithms.

Bubble sort is a simple sorting algorithm.It works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are wrong order.The pass through the list is repeaed until no swaps are needed,which indicates the list is sorted.

If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-

There should not be any Spelling Mistakes.

There should not be any Gramatical Errors.

Answers must not contain any bad words.

Answers should not be the repeat of same answer, already approved.

Answer should be complete in itself.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question