From f515542235f9c7807a8de848311c5f0a80018283 Mon Sep 17 00:00:00 2001 From: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com> Date: Sat, 10 Apr 2021 14:40:32 +0530 Subject: [PATCH] Typo fix patch (#154) * Update README.md fix typo ./README.md:14: seperated ==> separated * Update string-tokeniser.cpp fix typo ./strings/c-or-cpp/string-tokeniser.cpp:27: delimeter ==> delimiter * Update palindrome.js fix typo ./strings/js/palindrome.js:4: alpha-numeric ==> alphanumeric * Update quick-sort.java fix typo ./sorting/java/quick-sort.java:2: choosen ==> chosen * Update counting-sort.java fix typo ./sorting/java/counting-sort.java:4: algortithm ==> algorithm * Update merge-sort.java fix typo ./sorting/java/merge-sort.java:12: Funtion ==> Function * Update bubble-sort.cpp fix typo ./sorting/c-or-cpp/bubble-sort.cpp:21: swaping ==> swapping * Update and rename Insert_and_delete_beginning.c to Insert-and-delete-beginning.c fix typo ./linked-lists/c-or-cpp/Insert_and_delete_beginning.c:18: Intialize ==> Initialize and rename the file according to contribution guidlines * Update Insert-and-delete-beginning.c fix typo ./linked-lists/c-or-cpp/Insert_and_delete_beginning.c:37: beggining ==> beginning * Update bellman-ford.cpp fix typo ./graphs/c-or-cpp/bellman-ford.cpp:80: weigth ==> weight * Update README.md fix typo ./stacks/README.md:5: Paranthesis ==> Parenthesis * Rename balanced-paranthesis.cpp to balanced-parenthesis.cpp fix typo in name of the file * Update linear-search.cpp fix typos ./searching/c-or-cpp/linear-search.cpp:22: inputed ==> inputted ./searching/c-or-cpp/linear-search.cpp:24: inputed ==> inputted --- README.md | 2 +- graphs/c-or-cpp/bellman-ford.cpp | 4 ++-- ...t_and_delete_beginning.c => Insert-and-delete-beginning.c} | 4 ++-- searching/c-or-cpp/linear-search.cpp | 4 ++-- sorting/c-or-cpp/bubble-sort.cpp | 4 ++-- sorting/java/counting-sort.java | 2 +- sorting/java/merge-sort.java | 4 ++-- sorting/java/quick-sort.java | 4 ++-- stacks/README.md | 2 +- .../{balanced-paranthesis.cpp => balanced-parenthesis.cpp} | 2 +- strings/c-or-cpp/string-tokeniser.cpp | 2 +- strings/js/palindrome.js | 4 ++-- 12 files changed, 19 insertions(+), 19 deletions(-) rename linked-lists/c-or-cpp/{Insert_and_delete_beginning.c => Insert-and-delete-beginning.c} (93%) rename stacks/c-or-cpp/{balanced-paranthesis.cpp => balanced-parenthesis.cpp} (99%) diff --git a/README.md b/README.md index b888d36f..48050800 100644 --- a/README.md +++ b/README.md @@ -11,7 +11,7 @@ The directory tree has the following convention of `category/language/problem`, A unit `problem` must conform to the following specifications: - The name should be in lowercase. (**Eg.** `palindrome/`, `binary-search.cpp` etc.). -- Each word must be seperated by a **dash** or a **hyphen** (`-`). +- Each word must be separated by a **dash** or a **hyphen** (`-`). **If you have a problem that belongs to a new *topic* or *category* than one which are present:** 1. Create a new folder and an index for it inside (a readme, `README.md` file). diff --git a/graphs/c-or-cpp/bellman-ford.cpp b/graphs/c-or-cpp/bellman-ford.cpp index 12890e35..da06d1e4 100644 --- a/graphs/c-or-cpp/bellman-ford.cpp +++ b/graphs/c-or-cpp/bellman-ford.cpp @@ -77,7 +77,7 @@ int main() vectordist; bool neg = bellman_ford(graph,V,s,dist); - //if no negative weigth cycle is found... + //if no negative weigt cycle is found... if(neg) { cout<<"vertex Dist from Source\n"; @@ -89,4 +89,4 @@ int main() return 0; -} \ No newline at end of file +} diff --git a/linked-lists/c-or-cpp/Insert_and_delete_beginning.c b/linked-lists/c-or-cpp/Insert-and-delete-beginning.c similarity index 93% rename from linked-lists/c-or-cpp/Insert_and_delete_beginning.c rename to linked-lists/c-or-cpp/Insert-and-delete-beginning.c index 0a8fb7a0..22d0d163 100644 --- a/linked-lists/c-or-cpp/Insert_and_delete_beginning.c +++ b/linked-lists/c-or-cpp/Insert-and-delete-beginning.c @@ -15,7 +15,7 @@ struct node *current = NULL ; //Function to Print the Linked List void printList(){ printf("\nItem in the Linked List are : "); - // Intialize the ptr(pointer) with head location . + // Initialize the ptr(pointer) with head location . struct node *ptr = head ; // While Loop until we encounter a Node which is NULL . // NULL , signifies we are the end of the list . @@ -34,7 +34,7 @@ void insertBeg(int data){ link->data = data ; //Point the link's pointer to the current head link->next = head ; - //Update the Head to the node we want to insert at the beggining + //Update the Head to the node we want to insert at the begining head = link ; } diff --git a/searching/c-or-cpp/linear-search.cpp b/searching/c-or-cpp/linear-search.cpp index f35d7236..5340e643 100644 --- a/searching/c-or-cpp/linear-search.cpp +++ b/searching/c-or-cpp/linear-search.cpp @@ -19,9 +19,9 @@ int main() cout<>key; - cout<<"the inputed no is at position \n"; + cout<<"the inputted no is at position \n"; for(i=0;iarr[j+1]) - { // swaping array elements + { // swapping array elements temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; @@ -30,4 +30,4 @@ int main() cout<