归并排序算法

目录

• 目录

归并排序（MERGE-SORT）是利用归并的思想实现的排序方法
该算法采用经典的分治（divide-and-conquer）策略（分治法将问题分(divide)成一些小的问题然后递归求解，
治(conquer)的阶段则将分的阶段得到的各答案”修补”在一起，即分而治之)

%23%23%23%20%E7%9B%AE%E5%BD%95%0A%5Btoc%5D%0A%0A%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F%EF%BC%88MERGE-SORT%EF%BC%89%E6%98%AF%E5%88%A9%E7%94%A8%E5%BD%92%E5%B9%B6%E7%9A%84%E6%80%9D%E6%83%B3%E5%AE%9E%E7%8E%B0%E7%9A%84%E6%8E%92%E5%BA%8F%E6%96%B9%E6%B3%95%0A%E8%AF%A5%E7%AE%97%E6%B3%95%E9%87%87%E7%94%A8%E7%BB%8F%E5%85%B8%E7%9A%84%E5%88%86%E6%B2%BB%EF%BC%88divide-and-conquer%EF%BC%89%E7%AD%96%E7%95%A5%EF%BC%88%E5%88%86%E6%B2%BB%E6%B3%95%E5%B0%86%E9%97%AE%E9%A2%98%E5%88%86(divide)%E6%88%90%E4%B8%80%E4%BA%9B%E5%B0%8F%E7%9A%84%E9%97%AE%E9%A2%98%E7%84%B6%E5%90%8E%E9%80%92%E5%BD%92%E6%B1%82%E8%A7%A3%EF%BC%8C%0A%E6%B2%BB(conquer)%E7%9A%84%E9%98%B6%E6%AE%B5%E5%88%99%E5%B0%86%E5%88%86%E7%9A%84%E9%98%B6%E6%AE%B5%E5%BE%97%E5%88%B0%E7%9A%84%E5%90%84%E7%AD%94%E6%A1%88%22%E4%BF%AE%E8%A1%A5%22%E5%9C%A8%E4%B8%80%E8%B5%B7%EF%BC%8C%E5%8D%B3%E5%88%86%E8%80%8C%E6%B2%BB%E4%B9%8B)%0A%0A%20%20*%0A!%5Bcdda3f11c6efbc01577f5c29a9066772.gif%5D(evernotecid%3A%2F%2F3068A4CC-FCF1-4825-A679-8FE799E84227%2Fappyinxiangcom%2F25807730%2FENResource%2Fp47)%0A%0A!%5Be819299545385d7abd612948e8601908.png%5D(evernotecid%3A%2F%2F3068A4CC-FCF1-4825-A679-8FE799E84227%2Fappyinxiangcom%2F25807730%2FENResource%2Fp331)%0A%0A!%5B677cbcfdfc1247aa89e0bb536bdc0975.png%5D(evernotecid%3A%2F%2F3068A4CC-FCF1-4825-A679-8FE799E84227%2Fappyinxiangcom%2F25807730%2FENResource%2Fp332)%0A%0A!%5Bc17807b7c20938bec97dc334bc3d2a87.png%5D(evernotecid%3A%2F%2F3068A4CC-FCF1-4825-A679-8FE799E84227%2Fappyinxiangcom%2F25807730%2FENResource%2Fp333)%0A