      "    * Return result array\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n log(n))\n",
      "* Space: O(n+m), n = number of elements, m = recursion depth\n",
      "\n",
      "Most implementations are stable."
     ]
    },
    {
 
</s> remove     "* Is a naiive solution sufficient?\n",
 </s> add     "* Is a naive solution sufficient?\n", </s> remove     "* Is a naiive solution sufficient?\n",
 </s> add     "* Is a naive solution sufficient?\n", </s> remove     "Most implementations are stable."
 </s> add     "Misc:\n",
    "\n",
    "* Not in-place\n",
    "* Most implementations are stable\n",
    "\n",
    "Merge sort can be a good choice for data sets that are too large to fit in memory, as large chunks of data can be read and written to disk.\n",
    "\n",
    "Unlike many other sorting algorithms, merge sort is not done in-place.\n",
    "\n",
    "See: [Quicksort vs merge sort](http://stackoverflow.com/questions/70402/why-is-quicksort-better-than-mergesort)"
    "* Space: O(n)\n",
      "    * Return result array\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n log(n))\n",
    "* Space: O(n)\n",
      "\n",
      "Most implementations are stable."
     ]
    },
    {
keep keep keep keep replace keep keep keep keep keep
 Update merge sort challenge algorithm discussion (#138) 
sorting_searching/merge_sort/merge_sort_solution.ipynb