{"id":42,"date":"2022-03-30T04:56:53","date_gmt":"2022-03-30T04:56:53","guid":{"rendered":"http:\/\/www.programminginpython.com\/2023\/03\/30\/merge-sort-algorithm-in-python\/"},"modified":"2023-05-08T18:38:29","modified_gmt":"2023-05-08T18:38:29","slug":"merge-sort-algorithm-python","status":"publish","type":"post","link":"https:\/\/www.programminginpython.com\/merge-sort-algorithm-python\/","title":{"rendered":"Merge Sort Algorithm in Python"},"content":{"rendered":"

Hello everyone, welcome back to Programming In Python<\/a>. Here in this post am going to tell you how to implement Merge Sort Algorithm in Python. In the previous posts, I have said about Selection Sort<\/a> and Bubble Sort<\/a>, here this Merge sort is much more efficient than those two algorithms as their\u00a0time complexity is O(n2<\/sup>) in the average case and here it is O(n log n) in the worst case, this says how efficient Merge sort is than Selection<\/a> and Bubble<\/a> sort.<\/p>\n

Merge sort algorithm is a divide and conquer algorithm, where the main unsorted list is divided into 2 halves, and each of the halves is again divided into 2 halves until only a single element is left in the list. Now merge these sublists by sorting them and finally, the main list is sorted.<\/p>\n

<\/div>\r\n\t\t\t