Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
Basically in merge sort we use slice function so the above code is similat to quick sort which helps merge sort to use without slicing