diff --git a/.gitignore b/.gitignore
index ac50e4f..93cf60d 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1 +1,3 @@
.metadata/
+*/bin
+*/settings
\ No newline at end of file
diff --git a/SelectSort/.classpath b/SelectSort/.classpath
new file mode 100644
index 0000000..fb565a5
--- /dev/null
+++ b/SelectSort/.classpath
@@ -0,0 +1,6 @@
+
+
+
+
+
+
diff --git a/SelectSort/.project b/SelectSort/.project
new file mode 100644
index 0000000..fef3a59
--- /dev/null
+++ b/SelectSort/.project
@@ -0,0 +1,17 @@
+
+
+ SelectSort
+
+
+
+
+
+ org.eclipse.jdt.core.javabuilder
+
+
+
+
+
+ org.eclipse.jdt.core.javanature
+
+
diff --git a/SelectSort/.settings/org.eclipse.jdt.core.prefs b/SelectSort/.settings/org.eclipse.jdt.core.prefs
new file mode 100644
index 0000000..7341ab1
--- /dev/null
+++ b/SelectSort/.settings/org.eclipse.jdt.core.prefs
@@ -0,0 +1,11 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.7
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.7
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.source=1.7
diff --git a/SelectSort/src/com/toozhao/sort/SelectSort.java b/SelectSort/src/com/toozhao/sort/SelectSort.java
new file mode 100644
index 0000000..ee1e701
--- /dev/null
+++ b/SelectSort/src/com/toozhao/sort/SelectSort.java
@@ -0,0 +1,40 @@
+package com.toozhao.sort;
+
+/**
+ *
+ * @author Junv
+ *
+ */
+public class SelectSort {
+ // 定义需要排序的数
+ private static int[] array = { 10, 50, 8, 29, 30, 17, 12, 40, 32, 7, 4, 22 };
+
+ public static void main(String args[]) {
+ sort(array);
+ for (int flag : array) {
+ System.out.print(flag + " ");
+ }
+ }
+
+ public static void sort(int[] data) {
+ // 外层循环一次,找到i to (data.length-1)这个数组中最小的一个数。
+ for (int i = 0; i < (data.length - 1); i++) {
+ // temp用来标注值最小的那个数。
+ int temp = i;
+ for (int j = i + 1; j < data.length; j++) {
+ // 将temp 始终标记为最小那个数。
+ if (data[j] < data[temp]) {
+ temp = j;
+ }
+ }
+ // 如果i != temp 说明,最小那个数为data[temp],则交换。
+ if (i != temp) {
+ int t = data[i];
+ data[i] = data[temp];
+ data[temp] = t;
+
+ }
+ }
+ }
+
+}