A merge sort uses smaller, ordered lists which are easier to sort and merge than larger lists. It is usually more efficient and quicker than the bubble sort. It is more complex to code. It will still ...

Each run through the list, from start to finish, is known as a pass. The bubble sort continues until a pass is made where no values have been swapped. At this point, the list is sorted. 4, 27, 7, 12, ...