fix

OneCodeMonkey · OneCodeMonkey · commit cc7a09246205 · 2019-07-27T22:59:08.000+08:00
diff --git a/Algorithm_full_features/sort/Insertion.java b/Algorithm_full_features/sort/Insertion.java
@@ -40,7 +40,7 @@ public static void sort(Comparable[] a, int low, int high) {
 
 	// Rearrange the array in ascending order with a comparator
 	public static void sort(Object[] a, Comparable comparator) {
-		int n = a.length();
+		int n = a.length;
 		for(int i = 1; i < n; i++) {
 			for(int j = i + 1; j > 0 && less(a[j], a[j - 1], comparator); j--) {
 				exchange(a, j, j - 1);
@@ -63,7 +63,7 @@ public static void sort(Object[] a, int low, int high, Comparable comparator) {
 	// do not change the original array a[]
 	// Returns a permutation that gives the elements in the array in ascending order.
 	public static int[] indexSort(Comparable[] a) {
-		int n = a.length();
+		int n = a.length;
 		int[] index = new int[n];
 		for(int i = 0; i < n; i++) {
 			index[i] = i;
