cool

just wrote a cool sorting function fo sorting vectors in java..so whats so cool abt it ..its justr that i thought on what to ioptimize no. of swaps or number of comparison..since dealing with vectors i was actully setting memory to diff values so i figured its the swaps that need to optimize...
(didnt go for merge etc sort coz the avg list is of size 3-4)
chalo i guess most of the coding is done ..now the thing is to make it run..but before that aaram karungi..

--
a cool t shirt design:
in frnt written ..look on the other side for an infinite loop
in back written ..look on the other side for an infinite loop
:)