{"id":1505,"date":"2020-04-04T17:53:41","date_gmt":"2020-04-04T09:53:41","guid":{"rendered":"http:\/\/149.129.74.185\/?p=1505"},"modified":"2020-04-04T18:05:46","modified_gmt":"2020-04-04T10:05:46","slug":"%e9%ab%98%e7%ba%a7%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84-master-method","status":"publish","type":"post","link":"http:\/\/www.magicmipamipa.com\/?p=1505","title":{"rendered":"[\u9ad8\u7ea7\u6570\u636e\u7ed3\u6784] Master method"},"content":{"rendered":"

<\/p>\n

\n

\u9898\u76ee<\/strong><\/h1>\n
\n

2-1<\/span><\/p>\n

\n
\n

When solving a problem with input sizeN<\/span><\/span><\/span><\/span>by divide and conquer, if at each stage the problem is divided into 8 sub-problems of equal sizeN<\/span>\/<\/span>3<\/span><\/span><\/span><\/span>, and the conquer step takesO<\/span>(<\/span>N<\/span>\u200b<\/span>2<\/span><\/span><\/span>\u200b<\/span><\/span>\u200b<\/span><\/span><\/span><\/span>l<\/span>o<\/span>g<\/span>N<\/span>)<\/span><\/span><\/span><\/span>to form the solution from the sub-solutions, then the overall time complexity is __.(2\u5206)<\/span><\/p>\n

    \n