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

@@ -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).

graphs/c-or-cpp/bellman-ford.cpp

@@ -77,7 +77,7 @@ int main()
 	vector<int>dist;
 	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";

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 ;
 }
 

searching/c-or-cpp/linear-search.cpp

@@ -19,9 +19,9 @@ int main()
     
      cout<<array[i]<<" ";
      cout<<"\n";
-    cout<<"please enter the number which you want to find in the inputed array \n";
+    cout<<"please enter the number which you want to find in the inputted array \n";
     cin>>key;
-    cout<<"the inputed no is at position \n";
+    cout<<"the inputted no is at position \n";
     for(i=0;i<n;++i)
     {
       

sorting/c-or-cpp/bubble-sort.cpp

@@ -18,7 +18,7 @@ int main()
 		for (int j= 0; j< n-1; j++)
 		{    //comparing adjecent elements of array
 			if (arr[j]>arr[j+1])
-			{   // swaping array elements
+			{   // swapping array elements
 				temp = arr[j];
 				arr[j] = arr[j+1];
 				arr[j+1] = temp;

sorting/java/counting-sort.java

@@ -1,7 +1,7 @@
 public class CountingSort {
 
     /**
-     * Public method to use the counting sort algortithm
+     * Public method to use the counting sort algorithm
      * @param arr - the array in input
      */
     public void sort(int[] arr){

sorting/java/merge-sort.java

@@ -9,7 +9,7 @@ class MergeSortApp
 		arr = new int[]{12,54,222,54622,10,169,30}; //Array to sort
 	}
 
-    //Funtion to display/Print Array
+    //Function to display/Print Array
 	public void printArray()
 	{
 	for (int i=0;i<arr.length;i++)

sorting/java/quick-sort.java

@@ -1,5 +1,5 @@
 // Java program for implement Quick Sort
-//Note: Rightmost element in the array is choosen as pivot
+//Note: Rightmost element in the array is chosen as pivot
 class QuickSortBack
 {
 	private int[] arr;

stacks/README.md

@@ -2,4 +2,4 @@
 
 ### C or C++
 
-1. [Balanced Paranthesis](c-or-cpp/balanced-paranthesis.cpp)
+1. [Balanced Parenthesis](c-or-cpp/balanced-parenthesis.cpp)

strings/c-or-cpp/string-tokeniser.cpp

@@ -24,7 +24,7 @@ char* mystrtok(char* s, char d)
     // Start extracting string and
     // store it in array
     for (; input[i] != '\0'; i++) {
-        // If delimeter is not reached
+        // If delimiter is not reached
         // then add the current character
         // to result[i]
         if (input[i] != d)

strings/js/palindrome.js

@@ -1,7 +1,7 @@
 // JavaScript Palindrome Checker: Checks whether a word is the same in reverse. Ignores punctuation, capitalization & spaces.
 
 function isPalindrome(str) {
-    // First convert the string into proper alpha-numeric word
+    // First convert the string into proper alphanumeric word
     let properStr = str
         .replace(/[_\W]/g, "")
         .toLowerCase();