Merge Sort in Python - Githubissues

Asiatik / codezilla

⚡️ codezilla ⚡️ One giant 🦖 collection of algorithms & design patterns.

MIT License

143 stars 181 forks source link

Merge Sort in Python #448

Open sambey04 opened 4 years ago

sambey04 commented 4 years ago

Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.