Lec-51: Merge Sort in Python 🐍 with Code | DSA in Python 🐍

00:00 – Introduction
00:50 - example
01:36 – merge sort algorithm
03:00 – merge algorithm

In this video, discuss about the Merge sort is a divide-and-conquer algorithm that works by dividing the input array into smaller sub-arrays, sorting each sub-array recursively, and then merging the sorted sub-arrays to produce the final sorted array. Merge sort has a time complexity of O(nlog n).

► Python For Beginners(Complete Playlist):

Other Subject-wise Playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Computer Networks :
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Architecture:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:
► Class XI Computer Science(Full Syllabus)
► Microprocessor Playlist:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[nandiniv]

I was struggling to solve a merge sort question and this popped up. Thank you, Gate Smashers!!!
Your timing is impeccable as always

[ganeshwarde]

I am a sybca studant i attempt your every youtube lecture

[juniashalom]

Sir can you please enable the captions ... It would be helpful for students like me who doesn't understand the language... I have referred most of your videos with captions for DSA and it is really helpful..

[dous]

Hello Sir,
can you please enable captions on your videos? i reely want to watch your videos but i dont understand the language and captions are disabled
thank you

[khuzaimabilal]

Sirr plz start syllabus of simulation and modeling

[deepa-nethra]

Sir what if we have odd number of elements what do we do then how to divide

[khuzaimabilal]

Sir
Can u start simulation and modeling subject

[virenvlogs]

Sir HPSC CS ko support kro
Jo court case hua h
Paper
B. Ed vs non-B. Ed case me

[saitejavaddepalli]

In while use or condition instead of and

[harishdasari]

Here the last two elements are 80 and 90.And they are in sorted order
What else if there are in unsorted order like 90 and 80
If we use extend then 90 and 80 will be appended to new which is unsorted.
Can you please give clarity sir