basically merge sort use 2 separate arrays for holding left and right subarrays at each level. we just compare the elements as per put them in to subarray in upper level. so here only comparision and movement is done while swapping take to locations to interchange their values
so merge sort does not have swap operation