- 博客(2)
- 收藏
- 关注
RSS订阅快速排序的代码
package introductionToAlgorithms; public class QuickSort { static int[] a = {3,1,7,4,10,6,8,9,2,5}; static int findPivot(int low,int high) { int i = low, j = high+1; int pivotV...
2011-04-17 23:36:36
71
Two MS's interview
1. What is stack overflow? 2. What is stack? 3. What is constructor and what is deconstructor? 4. What is memory leakage? 1. 求二叉树中两个节点的最长距离的时间复杂度是(节点间a与b的距离等于a到根的距离加上b到根的距离) 2. 下面哪些情况可以构...
2011-04-15 14:44:58
80
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人