用折半查找法实现排序问题

publicStringup(Stringnumber,booleanupdown){inti=0;Strings="";StringTokenizertokenizer=newStringTokenizer(number,",");Array=newdouble[tokenizer.countTokens()];//字符串的解析,计算在生成异常之前可以调用此tokenizer的nextToken方法的次数/while(tokenizer.hasMoreTokens()){Stringd=tokenizer.nextTo