Skip to content
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

[NEW ALGORITHM] Find Minimum and Maximum in Array under Recursion #1678

Open
2 tasks done
rajdeepchakraborty-rc opened this issue Nov 5, 2024 · 3 comments · May be fixed by #1723
Open
2 tasks done

[NEW ALGORITHM] Find Minimum and Maximum in Array under Recursion #1678

rajdeepchakraborty-rc opened this issue Nov 5, 2024 · 3 comments · May be fixed by #1723

Comments

@rajdeepchakraborty-rc
Copy link
Contributor

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name:

[Find Minimum and Maximum in Array]

About:

Use recursion to find the minimum and maximum elements in a given array.


Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
@theonlybigmiao
Copy link

I think I can try it.Please assign it to me.

@rajdeepchakraborty-rc
Copy link
Contributor Author

@pankaj-bind Please review the issue and assign it to me.

@pankaj-bind
Copy link
Collaborator

assigned

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

Successfully merging a pull request may close this issue.

3 participants