shway
/
DSA
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

docs: fix grammar and punctuation errors (#1087) 

Co-authored-by: Aditya Sharma <adityasharma2004@gmail.com>
pull/1093/head
Aditya Sharma 2022-11-30 07:56:18 -05:00 committed by GitHub
parent 4b2835bae6
commit e60d299077
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
CONTRIBUTING.md
View File

@ -2,7 +2,7 @@
This documentation aims to simplify and guide the way beginners make their first contribution. If you are looking to make your first contribution, follow the steps below. This documentation aims to simplify and guide the way beginners make their first contribution. If you are looking to make your first contribution, follow the steps below.
_If you're not comfortable with command line, [here are tutorials using GUI tools.](#tutorials-using-other-tools)_ _If you're not comfortable with the command line, [here are tutorials using GUI tools.](#tutorials-using-other-tools)_
<img align="right" width="300" src="https://user-images.githubusercontent.com/68538660/106238740-67a62b80-61cf-11eb-9892-6a0877a80fbf.png" alt="fork this repository" /> <img align="right" width="300" src="https://user-images.githubusercontent.com/68538660/106238740-67a62b80-61cf-11eb-9892-6a0877a80fbf.png" alt="fork this repository" />
@ -61,7 +61,7 @@ git checkout -b add-new-file
## Make necessary changes and commit those changes ## Make necessary changes and commit those changes
Now open add or edit file in a text editor. Add code for any existing algorithm in other language or add some new algorithms. Make sure to update correspond README.md file if needed. Now, save the file. Now open add or edit file in a text editor. Add code for any existing algorithm in other language or add some new algorithms. Make sure to update the corresponding README.md file if needed. Now, save the file.
<img align="right" width="450" src="https://firstcontributions.github.io/assets/Readme/git-status.png" alt="git status" /> <img align="right" width="450" src="https://firstcontributions.github.io/assets/Readme/git-status.png" alt="git status" />

2
README.md
View File

@ -105,7 +105,7 @@ It can be any of the following ones
#### Source Code File #### Source Code File
The source code files, should either be in `src/` folder (**Eg.** `src/main.cpp` or `src/main.js`) or the root folder (**Eg.** `palindrome.go` or `App.java`) where `ext` is the file extension for the specific programming language. The source code files should either be in `src/` folder (**Eg.** `src/main.cpp` or `src/main.js`) or the root folder (**Eg.** `palindrome.go` or `App.java`) where `ext` is the file extension for the specific programming language.
Again, the source codes must conform to a valid file structure convention that the programming language enforces. Again, the source codes must conform to a valid file structure convention that the programming language enforces.

4
docs/en/Searching/Binary-Search.MD
View File

@ -13,7 +13,7 @@
1. Find the middle element of the array 1. Find the middle element of the array
2. Check whether the key is equal to middle element if yes then return the index and exit the program 2. Check whether the key is equal to middle element if yes then return the index and exit the program
3. If the 2 step didn't run then test whether the element is less than the middle element if yes then run the step: 1 between the start to middle-1 index 3. If the 2 step didn't run then test whether the element is less than the middle element if yes then run the step: 1 between the start to middle-1 index
4. If the 3 step didn't run then test whether the element is high than the middle element if yes then run the step: 1 between the middle+1 to last index. 4. If the 3 step didn't run then test whether the element is higher than the middle element if yes then run the step: 1 between the middle+1 to the last index.
5. Run the loop till the starting index is less than end index 5. Run the loop till the starting index is less than end index
6. If the loop over and data not found then return -1 that means data doesn't exist 6. If the loop over and data not found then return -1 that means data doesn't exist
> **Note:** The array should be sorted in ascending to descending order > **Note:** The array should be sorted in ascending to descending order
@ -26,7 +26,7 @@ Element to search: **20**
Procedure: Procedure:
Middle element:**30** and element is less then 30 so search between start to middle -1 index Middle element:**30** and element is less than 30 so search between start to middle -1 index
Middle element: **20** and yes the middle element is the key to found so return the index=**1** Middle element: **20** and yes the middle element is the key to found so return the index=**1**