Java Utililty Methods Array Sort

String[] ids_ = new String[array_.length];
for (int i = 0; i < array_.length; i++)
    ids_[i] = array_[i].toString();
for (;;) {
    boolean changed_ = false;
    for (int i = 0; i < array_.length - 1; i++) {
        String s = ids_[i];
        String t = ids_[i + 1];
...

for (int i = 0; i < a.length - 1; i++) {
    for (int j = i + 1; j < a.length; j++) {
        if (a[j].compareTo(a[i]) < 0) {
            String temp = a[i];
            a[i] = a[j];
            a[j] = temp;

int x[] = getColumnNos(colnos);
Arrays.sort(x);
colnos = getFormatedColumnNo(x);

if (s == null || s.length < 2) {
    return;
int l, j, ir, i;
String rra;
String[] ra = new String[s.length + 1];
for (int ix = 0; ix < s.length; ix++)
    ra[ix + 1] = s[ix];
...

String[] sSort = null;
if (sArray != null) {
    sSort = new String[sArray.length];
    System.arraycopy(sArray, 0, sSort, 0, sArray.length);
    Arrays.sort(sSort);
return sSort;

HashMap map = new HashMap();
for (int i = 0; i < str.length; i++) {
    map.put(new Integer(i), str[i]);
HashMap tmp = new HashMap();
for (int i = 0; i < str.length; i++) {
    char[] ch = str[i].toCharArray();
    StringBuffer sb = new StringBuffer();
...

if (strArray == null)
    return null;
String tmp = "";
for (int i = 0; i < strArray.length; i++) {
    for (int j = 0; j < strArray.length - i - 1; j++) {
        if (strArray[j].compareTo(strArray[j + 1]) < 0) {
            tmp = strArray[j];
            strArray[j] = strArray[j + 1];
...

Arrays.sort(strArray);
StringBuilder sb = new StringBuilder();
for (String str : strArray) {
    sb.append(str);
return sb.toString();

if (a.length != a2.length)
    throw new IllegalArgumentException("Arrays don't have same length!");
T[] aux = (T[]) a.clone();
S[] aux2 = (S[]) a.clone();
mergeSort(aux, aux2, a, a2, 0, a.length, 0);

Arrays.sort(array);
return array;