I often encounter these terms, seemingly bearing same semantics and meaning. I'm almost sure they mean same - the types of Algorithms categorized based on their implementation strategy/paradigm.

Just wondering if I'm right and I get this correct, because, again - in different books/courses these terms are encountered in the same context. I'm kind of a very critical to the exactness of the terms I read.

Could you please confirm or reject my assumption?


Yes, they all refer to a categorization in terms of design paradigms (such as greedy, divide and conquer, dynamic programming, et cetera).

| cite | improve this answer | |
  • $\begingroup$ I don't think that Design Patterns are the same as Algorithm Strategies. $\endgroup$ – someone12321 Apr 15 at 16:22
  • $\begingroup$ I think, in the context of Algorithms, they are indeed used interchangeably. After all, Algorithm design pattern, such as Divide and Conquer, is exactly a strategy, how to approach the problem, by dividing and solving halves recursively. $\endgroup$ – Giorgi Tsiklauri Apr 15 at 20:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.