#BubbleSort #sortingalgorithms #datastructureslectures
Compare first element with second element if first element is greater than second element those elements will be interchanged. We have to repeat the procedure until reaches the last element. If there are n elements all the elements will be arranged in sorted order in n-1 passes.