java运行长度10000的数组堆栈溢出，c++和Delphi都没有
public class TestSort { void Sort(int Low,int High,int a[]) { if (Low >= High) return; int i, j; j = a[Low]; for (i = Low + 1;i <= High; i++) { if (a[i] < j) { int k; k = j; j = a[i]; a[i] = k; } } a[Low] = j; Sort(Low + 1, High, a); } void QuickSort(int Low,int High,int a[]) { if (Low >= High) { return; } int low, high; low = Low; high = High; while(low < high) { while(low < high) { if(a[low] <= a[high]) { high--; } else { int i; i = a[low]; a[low] = a[high]; a[high] = i; break; } } low++; while(low < high) { if (a[low] <= a[high]) { low++; } else { int i; i = a[low]; a[low] = a[high]; a[high] = i; break; } } high--; } QuickSort(Low, high, a); QuickSort(low, High, a); } public static void main(String[]args) { int[] testArr = new int[1000]; for (int i = 0; i < testArr.length; i++) { testArr[i] = Integer.parseInt(Util.genRandomNum(1)); } for (int i = 0; i < testArr.length; i++) { System.out.println("i="+i+":"+testArr[i]); } TestSort testsort = new TestSort(); testsort.Sort(0, testArr.length - 1, testArr); System.out.print("Sort:/n"); int i; for (i = 0; i < testArr.length; i++) { System.out.print(testArr[i]); } System.out.print("/n"); }
import java.util.Random; public class Util { public static void main(String[] args) { System.out.println(Util.genRandomNum(1)); } /** * 生成随即密码 * * @param pwd_len * 生成的密码的总长度 * @return 密码的字符串 */ public static String genRandomNum(int pwd_len) { // 35是因为数组是从0开始的，26个字母+10个数字 final int maxNum = 10; int i; // 生成的随机数 int count = 0; // 生成的密码的长度 /*char[] str = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' };*/ char[] str = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' }; StringBuffer pwd = new StringBuffer(""); Random r = new Random(); while (count < pwd_len) { // 生成随机数，取绝对值，防止生成负数， i = Math.abs(r.nextInt(maxNum)); // 生成的数最大为36-1 if (i >= 0 && i < str.length) { pwd.append(str[i]); count++; } } return pwd.toString(); }