Sorting and Searching3:55 with Jay McGavren
To help further your understanding of algorithms, this course is going to look at two categories: sorting algorithms and searching algorithms. You could argue these are the easiest kinds of algorithms to learn. But in learning how these algorithms are designed, we'll cover useful concepts like "recursion" and "divide and conquer" that are used in many other sorts of algorithms, and can even be used to create brand new ones.
You can learn more about Binary Search in our Introduction to Algorithms course.
You need to sign up for Treehouse in order to download course files.Sign up