public int compareTo(String anotherString) {

    int len1 = count;

    int len2 = anotherString.count;

    //获取到两个字符串的较短的长度

    int n = Math.min(len1, len2);

    char v1[] = value;

    char v2[] = anotherString.value;

    int i = offset;

    int j = anotherString.offset;

    if (i == j) {

        int k = i;

        int lim = n + i;

        while (k < lim) {

            char c1 = v1[k];

            char c2 = v2[k];

            //如果两个字符的ASC不相同，则直接返回

if (c1 != c2) {

                return c1 - c2;

            }

            k++;

        }

    } else {

        while (n-- != 0) {

           char c1 = v1[i++];

           char c2 = v2[j++];

             //如果两个字符的ASC不相同，则直接返回

           if (c1 != c2) {

               return c1 - c2;

           }

        }

    }

    //如果都一样，返回两个字符串的长度查

    return len1 - len2;

    }

// 使用简单的循环排序

        for (int i = 0; i < array.length - 1; i++) {

            for (int j = i + 1; j < array.length; j++) {

                if (array[i].compareTo(array[j]) > 0) {

                    String temp = array[i];

                    array[i] = array[j];

                    array[j] = temp;

                }

            }

        }

        for (int i = 0; i < 5; i++) {

            System.out.println(array[i]);

        }

    }