Skip to content

Divide and Conquer #817

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

Jump to bottom
Closed
Erfaniaa opened this issue May 15, 2019 · 5 comments
Closed

Divide and Conquer #817

Erfaniaa opened this issue May 15, 2019 · 5 comments

Comments

@Erfaniaa
Copy link
Member

May we add a "divide and conquer" folder and add "closest pair of points" and "maximum sub-array" to it?
Also, we can add "meet in the middle" algorithms.
@siddharthjain1611
Copy link

I think that's a great idea.

@Dharni0607
Copy link
Contributor

I would like work on this, if nobody has taken it up.

@Erfaniaa
Copy link
Member Author

Erfaniaa commented Jul 2, 2019

Please send me an email to discuss and start coding together.
[email protected]

Dharni0607 added a commit to Dharni0607/Python that referenced this issue Jul 2, 2019
@Dharni0607
created divide_and_conquer folder and added max_sub_array_sum.py unde…
0458742 
…r it (issue TheAlgorithms#817)
@Dharni0607 Dharni0607 mentioned this issue Jul 2, 2019
Merged
Dharni0607 added a commit to Dharni0607/Python that referenced this issue Jul 2, 2019
@Dharni0607
created divide_and_conquer folder and added max_sub_array_sum.py unde…
5ba2868 
…r it (issue TheAlgorithms#817)
Dharni0607 added a commit to Dharni0607/Python that referenced this issue Jul 2, 2019
@Dharni0607
created divide_and_conquer folder and added max_sub_array_sum.py unde…
3ec9e28 
…r it (issue TheAlgorithms#817)
Erfaniaa pushed a commit that referenced this issue Jul 2, 2019
@Dharni0607 @Erfaniaa
Divide and conquer Algorithms Issue#817 (#938)
0f56ab5 
* add ons in string directory - Bayer_Moore_Search

* created divide_and_conquer folder and added max_sub_array_sum.py under it (issue #817)
@RCtechBosco
Copy link

RCtechBosco commented Jul 3, 2019 via email

Erfaniaa pushed a commit that referenced this issue Jul 4, 2019
@Dharni0607 @Erfaniaa
closest pair of points algo (#943)
035457f 
* created divide_and_conquer folder and added max_sub_array_sum.py under it (issue #817)

* additional file in divide_and_conqure (closest pair of points)
@github-actions
Copy link

github-actions bot commented Dec 2, 2019

Stale issue message

@cclauss cclauss closed this as completed Dec 2, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
5 participants
@cclauss @Erfaniaa @RCtechBosco @Dharni0607 @siddharthjain1611