Overlapping subproblems
id:
overlapping-subproblems-210-791873
title:
Overlapping subproblems
text:
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems. For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems. The problem of computing the nth Fibonacci number F(n), can be broken down into the subproblems of computing F(n − 1) and F
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Overlapping_subproblems
date created:
2004-11-17T19:58:42Z
date modified:
2024-09-11T17:04:38Z
main entity:
{"identifier":"Q7113766","url":"https://www.wikidata.org/entity/Q7113766"}
image:
fields total:
13
integrity:
14