Skip to content

#4 - Divide-and-Conquer#4

Open
rmascarenhas wants to merge 4 commits intomasterfrom
chap04
Open

#4 - Divide-and-Conquer#4
rmascarenhas wants to merge 4 commits intomasterfrom
chap04

Conversation

@rmascarenhas
Copy link
Owner

In this chapter

  • Divide and Conquer
  • Recurrences
  • Master method

Code

  • The maximum subarray problem
  • Strassen's algorithm

Exercises

exercises1
exercises2
exercises3
exercises4
exercises5
exercises6
exercises7
exercises8
exercises9
exercises10

Problems

problems1
problems2
problems3
problems4
problems5
problems6
problems7
problems8
problems9
problems10
problems11

Renato Mascarenhas added 4 commits December 11, 2014 14:46
Namely, the maximum subarray algorithm (naive, nlg(n) and linear
versions) and also the Strassen's algorithm for matrix multiplication.
@beirigo
Copy link

beirigo commented Jun 26, 2015

Sure

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

✂️

:trollface:

@rmascarenhas
Copy link
Owner Author

Very meaningful reviews guys, thanks for the feedback.

@laurocaetano
Copy link

Really nice job man. I'll try to get back to ITA sometime this year :)
❤️

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants