Given two sorting methods, determine which is more efficient.
Merge Sort vs. Bubble Sort
In terms of efficiency, Merge Sort is generally considered to be more efficient than Bubble Sort. This is because Merge Sort has an average time complexity of O(n log n), while Bubble Sort has an average time complexity of O(n^2). This means that for larger data sets, Merge Sort is able to sort the data more quickly than Bubble Sort.
Complete the following task based on the instruction and optional input provided.### Instruction:
Given two sorting methods, determine which is more efficient.

### Input:
Merge Sort vs. Bubble Sort

### Output:
In terms of efficiency, Merge Sort is generally considered to be more efficient than Bubble Sort. This is because Merge Sort has an average time complexity of O(n log n), while Bubble Sort has an average time complexity of O(n^2). This means that for larger data sets, Merge Sort is able to sort the data more quickly than Bubble Sort.