Thread: Sorting lowercase strings before uppercase strings

I can sort strings in a collection by uppercase and then lowercase though I was wondering if there is any way of doing it in reverse, sorting by lowercase then by uppercase.

	public int compare(String arg0, String arg1) {
		for(int i=0;i<arg0.length() && i<arg1.length();i++) {
			if((arg0.charAt(i) > 64 && arg0.charAt(i) < 91) || (arg0.charAt(i) > 97 && arg0.charAt(i) < 122)) {
				if(arg0.charAt(i) < arg1.charAt(i)) return 1;
				if(arg0.charAt(i) > arg1.charAt(i)) return -1;
			} else {
				if(arg0.charAt(i) < arg1.charAt(i)) return -1;
				if(arg0.charAt(i) > arg1.charAt(i)) return 1;
			}
		}
		return 0;
	}

--- Update ---

Here is a sample usage:

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class Sorter implements Comparator<String>
{
	@Override
	public int compare(String arg0, String arg1) {
		for(int i=0;i<arg0.length() && i<arg1.length();i++) {
			if((arg0.charAt(i) > 64 && arg0.charAt(i) < 91) || (arg0.charAt(i) > 97 && arg0.charAt(i) < 122)) {
				if(arg0.charAt(i) < arg1.charAt(i)) return 1;
				if(arg0.charAt(i) > arg1.charAt(i)) return -1;
			} else {
				if(arg0.charAt(i) < arg1.charAt(i)) return -1;
				if(arg0.charAt(i) > arg1.charAt(i)) return 1;
			}
		}
		return 0;
	}
	public static void main(String[] a) {
		List<String> l = new ArrayList<String>();
		l.add("String1");
		l.add("STRING1");
		l.add("STRING2");
		l.add("String2");
		/*Normal sort*/
		Collections.sort(l);
		System.out.println(l.toString());
		/*Custom sort*/
		Collections.sort(l, new Sorter());
		System.out.println(l.toString());
	}
}

Thanks Norm. I agree with the rule.