From 9bb7900f36bc664ab010a560a96484cbd020ec51 Mon Sep 17 00:00:00 2001
From: Jack <jack870131@outlook.com>
Date: Wed, 5 Dec 2018 22:16:24 +0000
Subject: [PATCH] Fix the Markdown Syntax Error (#20592)
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* Fix the Chinese Document of Java

Remove some words "的" which would make the description more fluent.

* Fix the Markdown Syntax Error

Fix the Markdown Syntax which initially would make the code cause confusion.
---
 .../sorting-algorithms/selection-sort/index.md           | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/guide/chinese/algorithms/sorting-algorithms/selection-sort/index.md b/guide/chinese/algorithms/sorting-algorithms/selection-sort/index.md
index c5a8368b29..c7601ab02a 100644
--- a/guide/chinese/algorithms/sorting-algorithms/selection-sort/index.md
+++ b/guide/chinese/algorithms/sorting-algorithms/selection-sort/index.md
@@ -40,14 +40,15 @@ for(int i = 0; i < n; i++)
 
 ### 在Javascript中实现
 
-\`\`\`Javascript 功能选择_排序（A）{ var len =数组_长度（A）; for（var i = 0; i <len - 1; i = i + 1）{ var j _min = i; for（var j = i + 1; j <len; j = j + 1）{ if（A \[j\] <A \[j_ min\]）{ j _min = j; } else {} } if（j_ min！== i）{ 交换（A，i，j\_min）; } else {} } }
+```
+Javascript 功能选择_排序（A）{ var len =数组_长度（A）; for（var i = 0; i <len - 1; i = i + 1）{ var j _min = i; for（var j = i + 1; j <len; j = j + 1）{ if（A \[j\] <A \[j_ min\]）{ j _min = j; } else {} } if（j_ min！== i）{ 交换（A，i，j\_min）; } else {} } }
 
 函数交换（A，x，y）{ var temp = A \[x\]; A \[x\] = A \[y\]; A \[y\] = temp; }
 ```
 ### Implementation in Python 
 ```
-
-蟒蛇 def seletion _sort（arr）： 如果不是arr： 回归 对于范围内的我（len（arr））： min_ i = i 对于范围内的j（i + 1，len（arr））： 如果arr \[j\] <arr \[min _i\]： min_ i = j arr \[i\]，arr \[min _i\] = arr \[min_ i\]，arr \[i\] \`\`\`
+蟒蛇 def seletion _sort（arr）： 如果不是arr： 回归 对于范围内的我（len（arr））： min_ i = i 对于范围内的j（i + 1，len（arr））： 如果arr \[j\] <arr \[min _i\]： min_ i = j arr \[i\]，arr \[min _i\] = arr \[min_ i\]，arr \[i\] 
+```
 
 ### 属性
 
@@ -64,4 +65,4 @@ for(int i = 0; i < n; i++)
 ### 参考
 
 *   [维基百科](https://en.wikipedia.org/wiki/Selection_sort)
-*   [可汗学院](https://www.khanacademy.org/computing/computer-science/algorithms#sorting-algorithms)
\ No newline at end of file
+*   [可汗学院](https://www.khanacademy.org/computing/computer-science/algorithms#sorting-algorithms)