private Object[] sort(DownloadMainNode[] childNodes){ if (sort==SORT_NO_SORT){
private Object[] sort(DownloadMainNode[] childNodes) { if (sort == SORT_NO_SORT) { sortedChildNodes = childNodes;
    private Object[] sort(DownloadMainNode[] childNodes){        if (sort==SORT_NO_SORT){            return childNodes;        }        else{            int n = childNodes.length;            DownloadMainNode tmp;            for (int i = 0; i < n - 1; i++) {              int k = i;              for (int j = i + 1; j < n; j++) {                if (isAscent) {                  if (compare(childNodes, j, k) < 0) {                    k = j;                  }                }                else {                  if (compare(childNodes, j, k) > 0) {                    k = j;                  }                }              }              tmp = childNodes[i];              childNodes[i] = childNodes[k];              childNodes[k] = tmp;            }            return childNodes;        }    }