diff --git a/src/basic/dfs/GraphDFS.java b/src/basic/dfs/GraphDFS.java
index 6790589..dcbc59d 100644
--- a/src/basic/dfs/GraphDFS.java
+++ b/src/basic/dfs/GraphDFS.java
@@ -21,6 +21,11 @@ public static void main(String[] args) throws IOException {
         System.out.print("열(col): ");
         int startCol = Integer.parseInt(br.readLine());
 
+        if(field[startRow][startCol] == 0){
+            System.out.println("시작 지점이 이동 불가능합니다.");
+            return;
+        }
+
         dfs.dfs(startRow, startCol);
     }
 
diff --git a/src/basic/sort/SortMain.java b/src/basic/sort/SortMain.java
index ca74283..36d6ac0 100644
--- a/src/basic/sort/SortMain.java
+++ b/src/basic/sort/SortMain.java
@@ -1,6 +1,8 @@
 package basic.sort;
 
+import basic.sort.impl.ASNPSort;
 import basic.sort.impl.Bubble;
+import basic.sort.impl.BubbleSortAgain;
 import basic.sort.impl.Insert;
 import basic.sort.impl.Merge;
 import basic.sort.impl.Quick;
@@ -12,7 +14,7 @@ public class SortMain {
     static Scanner scan = new Scanner(System.in);
     public static void main(String[] args){
 
-        Sort sort = new Quick();
+        Sort sort = new ASNPSort();
 
         int[] array;
 
diff --git a/src/basic/sort/impl/ASNPSort.java b/src/basic/sort/impl/ASNPSort.java
new file mode 100644
index 0000000..a973d2b
--- /dev/null
+++ b/src/basic/sort/impl/ASNPSort.java
@@ -0,0 +1,22 @@
+package basic.sort.impl;
+
+import basic.sort.Sort;
+
+public class ASNPSort implements Sort {
+
+    @Override
+    public void sort(int[] array) {
+
+        for(int i = 0 ; i < array.length;i++){
+            for(int j = i;j<array.length;j++){
+                if(array[i]>array[j]){
+                    swap(array,i,j);
+                }
+            }
+            printAllArray(array,i+1);
+        }
+
+
+
+    }
+}
diff --git a/src/basic/sort/impl/BubbleSortAgain.java b/src/basic/sort/impl/BubbleSortAgain.java
new file mode 100644
index 0000000..0d592f7
--- /dev/null
+++ b/src/basic/sort/impl/BubbleSortAgain.java
@@ -0,0 +1,26 @@
+package basic.sort.impl;
+
+import basic.sort.Sort;
+
+public class BubbleSortAgain implements Sort {
+
+    @Override
+    public void sort(int[] array) {
+        int num=1;
+
+        for(int i = 0; i<array.length;i++){
+            for(int j = 0; j<array.length-1;j++){
+                if(array[j]>array[j+1]){
+                    swap(array,j,j+1);
+
+                }
+
+            }
+
+            printAllArray(array,num++);
+        }
+
+
+
+    }
+}