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.

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

Improved Docs #1

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Improved Docs #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
7 changes: 7 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1 +1,8 @@
# BinarySearch

With this program, users are able to find whether an element exists in an array and at which index.
Users can input the size of the array they want to create and then enter the elements one by one.
Once all the elements are inserted, the array is displayed in it's raw format, unsorted. Then the user is informed
that in order to use the binary search algorithm the array needs to be sorted and they are asked to choose how it should be;
in ascending or descending order. Depending the user's choice a sequence of functions is triggered and the user is asked for
a last input regarding the element they want to find. If the element is found, the program terminates while if the element is not found there is a recursive call to the method that takes care of this functionality until an existent number is entered.