Skip to content

Navigation Menu

Appearance settings

Explore
By company size
By use case
By industry
View all solutions
Topics
- AI
- DevOps
- Security
- Software Development
- View all
Explore
- GitHub Sponsors
  Fund open source developers
- The ReadME Project
  GitHub community articles
Repositories
- Enterprise platform
  AI-powered developer platform
Available add-ons
Pricing

Search code, repositories, users, issues, pull requests...

Search

Clear

Search syntax tips

Provide feedback

We read every piece of feedback, and take your input very seriously.

Include my email address so I can be contacted

Saved searches

Use saved searches to filter your results more quickly

Name

Query

To see all available qualifiers, see our documentation.

Appearance settings

You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

TheAlgorithms / Python Public

Notifications You must be signed in to change notification settings
Fork 46.9k
Star 201k

Code
Issues 67
Pull requests 325
Discussions
Actions
Projects
Wiki
Security
Insights

Additional navigation options

Code
Issues
Pull requests
Discussions
Actions
Projects
Wiki
Security
Insights

A divide and conquer method in finding the maximum difference pair#3692

Merged

poyea merged 4 commits intoTheAlgorithms:masterTheAlgorithms/Python:masterfrom

choyiny:dnc/max-pairchoyiny/Python:dnc/max-pairCopy head branch name to clipboard

Nov 25, 2020

Conversation Commits4 (4)Checks Files changed

Commits

Commits on Oct 24, 2020

A divide and conquer method in finding the maximum difference pair
choyiny
authored
fix formatting issues
choyiny
authored
fix formatting issues
choyiny
authored
add doctest runner
choyiny
authored

Footer

© 2025 GitHub, Inc.

Footer navigation

Terms
Privacy
Security
Status
Docs
Contact

You can’t perform that action at this time.