Skip to content

ENH: two algorithms for the convex hull problem of a set of 2d points on a plain #1135

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 8 commits into from
Aug 17, 2019

Conversation

maxwell-aladago
Copy link
Contributor

  1. A naive brute-force algorithm
  2. A divide-and-conquer algorithm

return False

def __repr__(self):
return "({}, {})".format(self.x, self.y)
Copy link
Member

Choose a reason for hiding this comment

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

Try this one with an f”string” and see if it is more concise.

Copy link
Contributor Author

Choose a reason for hiding this comment

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

But f'strings' don't work with python 2 or?

@maxwell-aladago
Copy link
Contributor Author

maxwell-aladago commented Aug 17, 2019 via email

Copy link
Member

@cclauss cclauss left a comment

Choose a reason for hiding this comment

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

Impressive!

@maxwell-aladago
Copy link
Contributor Author

Impressive!

Thanks, I will make the suggested changes soon.

@cclauss cclauss merged commit 05c9a05 into TheAlgorithms:master Aug 17, 2019
stokhos pushed a commit to stokhos/Python that referenced this pull request Jan 3, 2021
… on a plain (TheAlgorithms#1135)

* divide and conquer and brute force algorithms for array-inversions counting

* divide and conquer and brute force algorithms for array-inversions counting

* divide and conquer and brute force algorithms for array-inversions counting

* a naive and divide-and-conquer algorithms for the convex-hull problem

* two convex-hull algorithms, a divide-and-conquer and a naive algorithm

* two convex-hull algorithms, a divide-and-conquer and a naive algorithm

* two convex-hull algorithms, a divide-and-conquer and a naive algorithm
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.

2 participants