|
|
@@ -8,8 +8,8 @@ public class SortAlgo7 {
|
|
|
return;
|
|
|
|
|
|
for (int i = 0; i < n - 1; i++) {
|
|
|
- if (arr[i] > arr[i + 1]) {
|
|
|
- swap(arr, i, i + 1);
|
|
|
+ if (arr[i] > arr[add(i , 1)]) {
|
|
|
+ swap(arr, i, add(i , 1));
|
|
|
}
|
|
|
}
|
|
|
BubbleSortRecursion(arr, n - 1);
|
|
|
@@ -17,9 +17,9 @@ public class SortAlgo7 {
|
|
|
|
|
|
public void BubbleSortWithoutRecursion(Integer arr[]) {
|
|
|
for (int i = arr.length; i > 1; i--) {
|
|
|
- for (int innerCounter = 0; innerCounter < arr.length - 1; innerCounter++) {
|
|
|
- if (arr[innerCounter] > arr[innerCounter + 1]) {
|
|
|
- swap(arr, innerCounter, (innerCounter + 1));
|
|
|
+ for (int innerCounter = 0; innerCounter < subtract(arr.length, 1); innerCounter++) {
|
|
|
+ if (arr[innerCounter] > arr[add(innerCounter , 1)]) {
|
|
|
+ swap(arr, innerCounter, add(innerCounter , 1));
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
@@ -30,4 +30,14 @@ public class SortAlgo7 {
|
|
|
arr[i] = arr[j];
|
|
|
arr[j] = t;
|
|
|
}
|
|
|
+
|
|
|
+ private int add(int value1, int value2)
|
|
|
+ {
|
|
|
+ return value1 + value2;
|
|
|
+ }
|
|
|
+
|
|
|
+ private int subtract(int value1, int value2)
|
|
|
+ {
|
|
|
+ return value1 - value2;
|
|
|
+ }
|
|
|
}
|