Merge Sort In Python Explained (With Example And Code)

Great explantion! Toll gemacht! 🙂 Danke Felix

Hi Team, in the line 2, it is giving me runtime error, stating mximum depth recursion comparison

Is it pythonic? Or is it code from an old C program adapted to run in python?
Clearly, the code demonstrates how the merge sort works.

Not one of the best, i would say the best explanation.

Neat clean and concise

big thankss

Hi, can someone please explain to me the recursion part? I can only vaguely understand how recursion works in this problem. Thank you

Great video but it would be better if you actually showed the steps that happen on the graph in the same order that they happen in the actually program when calling it recursively

I am not getting the right results

input = [2, 8, 5, 1, 4]

output: [1, 2, 4, 4, 4]

Can you help on this? @FelixTechTips

Its my first algorithm in my life and I am finally able to code it.
Thank you for your help.

Keep making tuts :)

instead of printing the order way, it prints in random order

best explanation yet thanks.

you didnt run the code… you just typed the results in a comment line

You've done more for mankind then democracy ever has.

thank you so much, You saved me, I tried to implement merge sort with C, but most of C tutorials make it complicated

yeah really its very simple to understand the concept thanks dude
for me before reaching to this video i think that merge sort is very hard to understand but when i saw this video i can say its very very simple
thank you so much dude😊😊

Cool realization!