Talk:Divide and conquer algorithm

From Wikipedia, the free encyclopedia

This article is within the scope of the following WikiProjects:

WikiProject Computer science (Rated B-Class) This article is within the scope of WikiProject Computer science, which aims to create a comprehensive computer science reference for Wikipedia. Visit the project page for more information and to join in on related discussions. B rated as B-Class on the assessment scale High rated as high-importance on the assessment scale WikiProject Systems     (Rated B-Class) Systems science Portal This article is within the scope of WikiProject Systems, which collaborates on articles related to Systems science. Systems rating: B Class High importance  Field: Operations research Please update this rating as the article progresses, or if the rating is inaccurate. Please also add comments to suggest improvements to the article.

[edit] Usage

what percentage of people use the divide and copnquer method?

100% of programmers. You cannot get around it. -71.136.79.237

RE: "One commonly argued disadvantage of a divide-and-conquer approach is that recursion is slow"

Surely not. Function calls are fast and tail calls can be branches...!!!!!