RE: Java - Backwards - Second Draft |
||
 Lt dopel As far a running time both are exactly the same, O(n). You have 2 string, one of length "n", the other of length "m." The worst case run time would be the shortest of the two, which is this case would be at most n. If there is some jvm optimization that makes one faster than the other, it would be on the order of milliseconds. On 2005-02-26 02:15:52, flamebalrog wrote >On 2005-02-24 20:18:01, SAJChurchey wrote >> >>public static String Backwards(String str){ >> if(str == null || str.trim().equals("")) >> return ""; >> str = str.trim(); >> StringBuffer newString = new StringBuffer(str); >> return newString.reverse().toString(); >>} >> > >A not-null-and-not-empty-and-not-space-only String (one that will be reversed) is trimmed twice with your code (1st to test it, 2nd after the test). You could avoid it. > >Also, I think ' "literalString".equals(expression) ' is faster than ' expression.equals("literalString") '...can anyone confirm ? Replies:
|
||
| CyberArmy::Forum v0.6 Generated In 0.02252 seconds |
2005-02-15 17:19:31
2006-01-03 05:04:05
2005-03-21 03:08:22
2005-03-14 19:01:39
2005-03-18 17:04:23
2005-03-24 22:41:05
2005-02-17 20:09:14
2005-02-15 20:12:52