How Merge Sort Works?? Full explanation with example

👉Links for DAA Notes:

🧑‍🎓Contributed by: Junaid Gazi

🧑‍🎓Contributed by: Mannu Garg

The “Merge Sort” uses a recursive algorithm to achieve its results. The divide-and-conquer algorithm breaks down a big problem into smaller, more manageable pieces that look similar to the initial problem. It then solves these subproblems recursively and puts their solutions together to solve the original problem.

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►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:

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

[aritramukherjee]

00:01 Explanation of merge sort workings.
00:55 Understanding the working of merge sort is crucial.
02:01 Merge sort algorithm divides the problem into smaller parts.
03:15 Dividing and completing the process
04:29 Merging and sorting in the example
06:00 Merge sort explanation using fan and music analogy
07:13 How the process is carried out
08:32 Explanation of how to handle smaller and larger numbers in Merge Sort

[sadhanas]

You explained it sooo good that I understood it in one go! Thank you sir

[mihirmotwani]

Like AI is irreplaceable, Varun sir is also irreplaceable. Sir, Hats off for your hardwork.Thanks a lot sir.

[handover]

I went through multiple videos to understand this but my search ends here. Very nicely explained.

[akanksharaj]

Thankyou sir for the entire lectures all lectures are very useful for me... i had completed my all concept till today🙏thnq so much🙏🙏...

[adarshmishra]

Thank you sir you made our btech so easy!!

[sanikatiwarekar]

It's Varun's world and we just live in it 🙏🙏🙏 big fan of your teaching sir !

[vandittyagi]

Thank you Sir..I got 65 number in Computer network(AKTU exam) because of you.
I didn't studied whole semester but watched your whole series of Computer networks one day before exam. 👍👍

[gopalmakmar]

Sir, can you start course for cloud computing lecture preparation

[sscode]

Woh sir your explanation is very easy you are great teacher 👍👍👍👍👌👌👌🥰🥰🥰

[jaypandya]

Your explanation trices very nice sir . Thank you sir.

[ayush_pandey_]

What an attitude sir! You always seems down to earth🤗

[kapils]

sir aap bahut accha kaam krte ho ye videos banake <3

[itxx.abhi____]

Nice vedio ek baar me samjh me aagaya sir Thanku

[chaitanyasharma]

Sir, Thank you for this . Hello a lot in my presentation.🙏

[ekvjqng]

thank u very much sir, you made it is so easy

[programmingguideBhargavi]

Best case and values in desecending order which element choose as piviot element

[GURUJI-uvdw]

# GATE SMASHERS Sir Aapki Videos SE Concept 1 Dum Crystal Clear Ho Jata Hai

# 👍 Like, Share, Subscribe # Gate Smashers Channel Ko