基数排序

Author: andyRon

Radix Sort/README.md

@@ -1,24 +1,36 @@
 # Radix Sort
+# 基数排序
 
 Radix sort is a sorting algorithm that takes as input an array of integers and uses a sorting subroutine( that is often another efficient sorting algorith) to sort the integers by their radix, or rather their digit.  Counting Sort, and Bucket Sort are often times used as the subroutine for Radix Sort.
+基数排序是一种排序算法，它将整数数组作为输入，并使用排序子程序（通常是另一种有效的排序算法）来按整数基数或者它们的数字对整数进行排序。 Counting Sort和Bucket Sort通常用作Radix Sort的子程序。
 
 ## Example
+## 例子
 
 * Input Array: [170, 45, 75, 90, 802, 24, 2, 66]
 * Output Array (Sorted):  [2, 24, 45, 66, 75, 90, 170, 802]
 
 ### Step 1:
+### 第一步：
+
 The first step in this algorithm is to define the digit or rather the "base" or radix that we will use to sort.
 For this example we will let radix = 10, since the integers we are working with in the example are of base 10.
+此算法的第一步是定义数字，或者更确切地说是我们将用于排序的“基数”或基数。
+对于这个例子，我们将radix = 10，因为我们在示例中使用的整数是基数10。
 
 ### Step 2:
+### 第二步：
+
 The next step is to simply iterate n times (where n is the number of digits in the largest integer in the input array), and upon each iteration perform a sorting subroutine on the current digit in question.
+下一步是简单地迭代n次（其中n是输入数组中最大整数中的位数），并且在每次迭代时对当前数字执行排序子程序。
 
 ### Algorithm in Action
 
 Let's take a look at our example input array.
+我们来看看我们的示例输入数组。
 
 The largest integer in our array is 802, and it has three digits (ones, tens, hundreds).  So our algorithm will iterate three times whilst performing some sorting algorithm on the digits of each integer.
+我们数组中的最大整数是802，它有三位数（一，十，百）。 因此，我们的算法将迭代三次，同时对每个整数的数字执行一些排序算法。
 
 * Iteration 1:  170, 90, 802, 2, 24, 45, 75, 66
 * Iteration 2:  802, 2, 24, 45, 66, 170, 75, 90
@@ -29,3 +41,6 @@ The largest integer in our array is 802, and it has three digits (ones, tens, hu
 See also [Wikipedia](https://en.wikipedia.org/wiki/Radix_Sort).
 
 *Written for the Swift Algorithm Club by Christian Encarnacion*
+
+*作者：Christian Encarnacion*  
+*翻译：[Andy Ron](https://github.com/andyRon)*

Radix Sort/README_en.md

@@ -0,0 +1,31 @@
+# Radix Sort
+
+Radix sort is a sorting algorithm that takes as input an array of integers and uses a sorting subroutine( that is often another efficient sorting algorith) to sort the integers by their radix, or rather their digit.  Counting Sort, and Bucket Sort are often times used as the subroutine for Radix Sort.
+
+## Example
+
+* Input Array: [170, 45, 75, 90, 802, 24, 2, 66]
+* Output Array (Sorted):  [2, 24, 45, 66, 75, 90, 170, 802]
+
+### Step 1:
+The first step in this algorithm is to define the digit or rather the "base" or radix that we will use to sort.
+For this example we will let radix = 10, since the integers we are working with in the example are of base 10.
+
+### Step 2:
+The next step is to simply iterate n times (where n is the number of digits in the largest integer in the input array), and upon each iteration perform a sorting subroutine on the current digit in question.
+
+### Algorithm in Action
+
+Let's take a look at our example input array.
+
+The largest integer in our array is 802, and it has three digits (ones, tens, hundreds).  So our algorithm will iterate three times whilst performing some sorting algorithm on the digits of each integer.
+
+* Iteration 1:  170, 90, 802, 2, 24, 45, 75, 66
+* Iteration 2:  802, 2, 24, 45, 66, 170, 75, 90
+* Iteration 3:  2, 24, 45, 66, 75, 90, 170, 802
+
+
+
+See also [Wikipedia](https://en.wikipedia.org/wiki/Radix_Sort).
+
+*Written for the Swift Algorithm Club by Christian Encarnacion*