摘要：void permutation(char *Pbegin, char *Pend) { if(!Pbegin || !Pend) return; /////////////////////// //if Pbegin equal to Pend //this round is finished //print if(*Pend) ... 阅读全文

摘要：Q: An int array, devide an array of integers into two parts, odd in the first part, and even in the second part. We need some sub Function: 1: IsEven(int n) // n is Even or not 2: void Reorder(int *p... 阅读全文

摘要：Writing Better Code How to Interview a Programmer by Bill Venners February 24, 2003 Summary Recognizing good programmers among job applicants is not easy. This article contains interview techniques,... 阅读全文

摘要：This is a question from Microsoft, in general, recurtion is first tip on binary tree. Convert a Binary search tree to double linked list, and no new point, only change pointer. for example: ... 阅读全文