Explain bubble sort.

Interview Questions and Answers

Q1. Explain bubble sort.

Ans. array is traversed from first element to last element. Here current element is compared with next element. If current element is greater than next element it is swapped.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve sorting bubble sort Asked in 1 Companies}

Related Questions

Collections.sort can only be performed on ..

a. Set
b. List
c. Map
d. Any Collection implementation

If I try to add Enum constants to a TreeSet, What sorting order will it use ?

In what order the elements of a HashSet are retrieved ?

Explain various Searching and Sorting Algorithms ?

Which sorting algorithm is used by Collections.sort() in Java ?

If we add Enum constants to a sorted collection ( Treemap , TreeSet ), What will be the order in which they will be maintained ?

Write an algorithm / java program for Heap Sort ?

Write any sorting algorithm.

Explain different sorting algorithms and Big O of each

Search Interview Questions

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.