DSA algorithms on bubble and merge sort

Question

Accepted Answer

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. Merge sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts the two halves, and then merges the sorted halves.

Bubble sort has a time complexity of O(n^2) in worst case scenario, while merge sort has a time complexity of O(n log n).
Bubble sort is not efficient for large datasets, while merge sort is efficient for any size of dataset.
Merge sort requires additional space for merging the subarrays, while bubble sort is an in-place sorting algorithm.
Example: Bubble sort - [5, 3, 8, 2, 1] -> [3, 5, 2, 1, 8] -> [3, 2, 1, 5, 8] -> [2, 1, 3, 5, 8] -> [1, 2, 3, 5, 8]
Example: Merge sort - [38, 27, 43, 3, 9, 82, 10] -> [38, 27, 43, 3] [9, 82, 10] -> [38, 27] [43, 3] [9, 82] [10] -> [27, 38] [3, 43] [9, 82] [10] -> [3, 27, 38, 43] [9, 10, 82]

DSA algorithms on bubble and merge sort

Popular interview questions of Software Developer