From 6ad31a1b9c2525e2968bf58c4ea3781bd0aec2a7 Mon Sep 17 00:00:00 2001 From: Crystal Hess Date: Thu, 6 Oct 2016 08:53:57 -0700 Subject: [PATCH] deletes a confusing explanation line --- README.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/README.md b/README.md index 0f7f357..b971907 100644 --- a/README.md +++ b/README.md @@ -2,8 +2,6 @@ The recursive part of this problem is short -- happening only in the mergesort method, but driving the entire algorithm. -Your goal is to make mergesort work, using recursion. - The `split_array` method is not mandatory to use, but I think it makes the solution a little easier to read and follow by making the `mergesort` method read almost exactly like the psuedocode, hiding all the details of how it works in other methods. -The hardest part of this problem, I think, will be writing the combine method and dealing with all the cases that occur when combining two lists of sorted numbers. This is an iterative solution, not a recursive solution. +The hardest part of this problem is writing the combine method and dealing with all the cases that occur when combining two lists of sorted numbers. **This is part is iterative, not recursive.**