search

exercism / unison

Exercism exercises in Unison.
https://exercism.org/tracks/unison
MIT License
3 stars 19 forks source link

binary-search: implement exercise #95

Closed dreig closed 1 year ago

dreig commented 1 year ago

I looked at the Haskell track for inspiration when implementing this exercise.

I've assign a difficulty of 5 (just like in the Haskell track) and chose to use data.Array arrays to store the sorted numbers. I also added the .docs/instructions.append.md with links to documentation on Unison arrays. Should I have used Array.slice instead of indices in the example implementation?

github-actions[bot] commented 1 year ago

Hello. Thanks for opening a PR on Exercism. We are currently in a phase of our journey where we have paused community contributions to allow us to take a breather and redesign our community model. You can learn more in this blog post. As such, all issues and PRs in this repository are being automatically closed.

That doesn't mean we're not interested in your ideas, or that if you're stuck on something we don't want to help. The best place to discuss things is with our community on the Exercism Community Forum. You can use this link to copy this into a new topic there.

Note: If this PR has been pre-approved, please link back to this PR on the forum thread and a maintainer or staff member will reopen it.