docs: fix grammar and punctuation errors (#1087)
Co-authored-by: Aditya Sharma <adityasharma2004@gmail.com>pull/1093/head
parent
4b2835bae6
commit
e60d299077
|
@ -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.
|
||||
|
||||
_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" />
|
||||
|
||||
|
@ -61,7 +61,7 @@ git checkout -b add-new-file
|
|||
|
||||
## 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" />
|
||||
|
||||
|
|
|
@ -105,7 +105,7 @@ It can be any of the following ones
|
|||
|
||||
#### 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.
|
||||
|
||||
|
|
|
@ -13,7 +13,7 @@
|
|||
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
|
||||
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
|
||||
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
|
||||
|
@ -26,7 +26,7 @@ Element to search: **20**
|
|||
|
||||
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**
|
||||
|
||||
|
|
Loading…
Reference in New Issue