Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Computer Science Introduction to Data Structures The Merge Sort Algorithm Recap: Merge Sort

Merge sort uses an algorithmic technique known as


7 Answers

Merge sort involves splitting the array in half, and repeating the process with the sub-arrays. Once it is completely split up , you merge the arrays back together. This technique of "splitting and merging" is called divide and conquer

Divide and conquer

The first D should be upperCase and no spaces otherwise it will fail

Linked the teacher's notes and explained @2:00 here. Merge sort is a divide and conquer algorithm.

its refusing i dont know why

Jason Anders
Jason Anders
Treehouse Moderator 145,858 Points

This seems to be a very sensitive question. While either Title case or Lower case will work, if you somehow have a space after any of the words, it fails. :confused:


Merge sort is a divide and conquer algorithm.

Divide and conquer