Coding Without Taxation

Russ Olsen's example Java code is written in such an absurd way that it will be seen as a deliberate attempt to write bad code, let's see if I can do something as ridiculous with Smalltalk:

array_sort: anArray
   ^anArray sort: [:arg0 :arg1 |
      | length0 length1 |
      length0 := arg0 length.
      length1 := arg1 length.

      (length0 < length1) 
         ifTrue: [ ^true ]
         ifFalse: [
            (length0 = length1)
                ifTrue: [ ^true ]
                ifFalse [ ^false ]
         ]
   ]

This might be because it's Friday afternoon but when looking at compare api for Java, I don't think his code is that absurd.  If you skip some formatting it bascially comes down to 3 lines of code.

Needless to say I prefere sort: [:a :b | a length < b length]  anytime over those pesky java compare functions ;)

iceken wrote when looking at compare api for Java
Why are you looking at ye olde Java 1.4.2 api?

The first comment on Russ Olsen's blog corrects his comical 17 lines to

public void array_sort(String[] strings){
   Arrays.sort(strings, new Comparator() {
      public int compare(String arg0, String arg1) {
         return arg0.length() - arg1.length();
      }
   });
}