Anant Singh

Introduction to Bubble Sort

Bubble Sort is the simplest Sorting Algorithm that compares two adjacent elements and swaps them until they are in the intended order. Bubble Sort algorithm is not suitable for the large data sets because its average and worst-case time complexity is quite high. This algo actually works on the concept of repeatedly comparing the neighbor elements, from left to right, and then swapping them if they are out-of-order. In bubble sort, the repetition continues till we get the sorted array. Bubble compares all the elements in a array successively and sorts them based on their values.