Skip to content

Fully refactored the rod cutting module. #1169

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.

Sign up for GitHub

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
cclauss merged 4 commits into from
Sep 5, 2019
Merged

Fully refactored the rod cutting module. #1169

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
fb1f380
changing typo
maxwell-aladago Sep 4, 2019
ab09a86
fully refactored the rod-cutting module
maxwell-aladago Sep 4, 2019
5bd0887
more documentations
maxwell-aladago Sep 4, 2019
2af5bf9
rewording
maxwell-aladago Sep 4, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
changing typo
  • Loading branch information
@maxwell-aladago
maxwell-aladago committed Sep 4, 2019
commit fb1f3809da2dd01f8612540cb1d61ebd4a4e0335
2 changes: 1 addition & 1 deletion divide_and_conquer/convex_hull.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@

Two algorithms have been implemented for the convex hull problem here.
1. A brute-force algorithm which runs in O(n^3)
2. A divide-and-conquer algorithm which runs in O(n^3)
2. A divide-and-conquer algorithm which runs in O(n log(n))

There are other several other algorithms for the convex hull problem
which have not been implemented here, yet.
Expand Down