Last active
January 14, 2016 13:34
-
-
Save Yur-ok/169b9e80b37bf5559b4e to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package Lesson3.KeyPoint3; | |
import java.util.Arrays; | |
/** | |
* Created by Юрий on 19.12.2015. | |
*/ | |
public class SortUseSwap { | |
static int len; | |
public static void main(String[] args) { | |
int[] arr = {10, 9, 8, 7, 6}; | |
int[] arr2 = {0, 10, 3, 9}; | |
int[] arr1 = null; | |
int[] arr11 = new int[0]; | |
sort(arr); | |
sort(arr2); | |
sort(arr1); | |
sort(arr11); | |
System.out.println(Arrays.toString(arr)); | |
System.out.println(Arrays.toString(arr2)); | |
} | |
static void sort(int[] data) { | |
if (data == null || data.length == 0) { | |
System.out.println(-1); | |
return; | |
} | |
len = data.length - 1; | |
for (int idx = 0; idx < data.length - 1; idx++) { | |
swap(data); | |
len--; | |
} | |
} | |
static void swap(int[] data) { | |
int temp; | |
for (int i = 0, k = 1; (i <= len && k <= len); i++, k++) { | |
if (data[i] < data[k]) { | |
continue; | |
} else { | |
temp = data[i]; | |
data[i] = data[k]; | |
data[k] = temp; | |
} | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Использование глобальной переменной в этом задании плохо. Код становится не прозрачным и легко читаемым.