Javascript -> JavaScript (English) (#35183)

* Javascript -> JavaScript (English)

* Update technical documentation page for required change

* Update use-class-syntax-to-define-a-constructor-function.english.md

* Update left-factorials.md

guide/english/algorithms/greatest-common-divisor-euclidean/index.md

@@ -42,7 +42,7 @@ Step 4: **Repeat Steps 2 and 3 until `a mod b` is greater than 0**
 Step 5: **GCD = b**  
 Step 6: Finish  
 
-Javascript Code to Perform GCD-
+JavaScript Code to Perform GCD-
 ```javascript
 function gcd(a, b) {
   var R;
@@ -55,7 +55,7 @@ function gcd(a, b) {
 }
 ```
 
-Javascript Code to Perform GCD using Recursion-
+JavaScript Code to Perform GCD using Recursion-
 ```javascript
 function gcd(a, b) {
   if (b == 0)

guide/english/algorithms/search-algorithms/binary-search/index.md

@@ -92,7 +92,7 @@ Binary Search Trees are very powerful because of their O(log n) search times, se
 
 The code for recursive binary search is shown below:
 
-### Javascript implementation
+### JavaScript implementation
 
 ```javascript
 function binarySearch(arr, item, low, high) {
@@ -120,9 +120,9 @@ var numbers = [1,2,3,4,5,6,7];
 print(binarySearch(numbers, 5, 0, numbers.length-1));
 ```
 
-Here is another implementation in Javascript:
+Here is another implementation in JavaScript:
 
-```Javascript
+```JavaScript
 function binary_search(a, v) {
     function search(low, high) {
         if (low === high) {

guide/english/algorithms/search-algorithms/linear-search/index.md

@@ -55,7 +55,7 @@ int linearSearch(int arr[], int num)
 
 ```
 
-### Example in Javascript
+### Example in JavaScript
 ```javascript
 function linearSearch(arr, item) {
   // Go through all the elements of arr to look for item.

guide/english/algorithms/sorting-algorithms/insertion-sort/index.md

@@ -96,7 +96,7 @@ The algorithm shown below is a slightly optimized version to avoid swapping the
          arr[i+1] = key
 ```
 
-Here is a detailed implementation in Javascript:
+Here is a detailed implementation in JavaScript:
 
 ```
 function insertion_sort(A) {

guide/english/algorithms/sorting-algorithms/selection-sort/index.md

@@ -66,8 +66,8 @@ void recurSelectionSort(int a[], int n, int index = 0)
 }
 ```
 
-### Implementation in Javascript
-``` Javascript
+### Implementation in JavaScript
+```js
 function selection_sort(A) {
     var len = A.length;
     for (var i = 0; i < len - 1; i = i + 1) {