fix(guide) Replace invalid prism code block names (#35961)

* fix: replace sh with shell

fix replace terminal with shell

fix replace node with js

fix replace output with shell

fix replace cs with csharp

fix replace c++ with cpp

fix replace c# with csharp

fix replace javasctipt with js

fix replace syntax  with js

fix replace unix with shell

fix replace linux with shell

fix replace java 8 with java

fix replace swift4 with swift

fix replace react.js with jsx

fix replace javascriot with js

fix replace javacsript with js

fix replace c++ -  with cpp

fix: corrected various typos

fix: replace Algorithm with nothing

fix: replace xaml with xml

fix: replace solidity with nothing

fix: replace c++ with cpp

fix: replace txt with shell

fix: replace code with json and css

fix: replace console with shell

guide/chinese/algorithms/sorting-algorithms/bubble-sort/index.md

@@ -123,7 +123,7 @@ public class bubble-sort {
 
 ### 冒泡排序的递归实现。
 
-```c++
+```cpp
 void bubblesort(int arr[], int n) 
  { 
     if(n==1)    //Initial Case 

guide/chinese/algorithms/sorting-algorithms/heap-sort/index.md

@@ -67,7 +67,7 @@ import java.util.Arrays;
 
 在C ++中实现
 
-```C++
+```cpp
 #include <iostream> 
  using namespace std; 
  void heapify(int arr[], int n, int i) 

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

@@ -92,7 +92,7 @@ localeTitle: 插入排序
 
 以下算法是略微优化的版本，以避免在每次迭代中交换`key`元素。这里， `key`元素将在迭代结束时交换（步骤）。
 
-```Algorithm
+```
     InsertionSort(arr[]) 
       for j = 1 to arr.length 
          key = arr[j] 

guide/chinese/algorithms/sorting-algorithms/merge-sort/index.md

@@ -23,7 +23,7 @@ T(n) = 2T(n/2) + n
 
 计算结尾总和中n的重复次数，我们看到它们有lg n + 1。因此运行时间是n（lg n + 1）= n lg n + n。我们观察到，对于n> 0，n lg n + n <n lg n + n lg n = 2n lg n，因此运行时间为O（n lg n）。
 
-```Algorithm
+```
 MergeSort(arr[], left,  right): 
  If right > l: 
      1. Find the middle point to divide the array into two halves: