1.自我介绍
2.手写快排。这里出现一个问题,快排写的时候思想是按照严蔚敏数据结构第2版中的思想进行写的,按照递归的思路;面试官说他没见到过这样写的,好吧~写了个序列推了一把,再推导的时候我当时应该占主导地位的,当时面试官好几个地方推错了,没有直接指出来:(下面是我写的)
//#include "header.h" //Anycodes includes the head file by default, needn't cancle the notation.
#include <stdio.h>
#include <stdlib.h>
int QPoint(int k[],int low,int high)
{
int point=k[low];
while(low<high)
{
while(k[high]>=point&&low<high)
{
high--;
}
k[low]=k[high];
while(k[low]<=point&&low<high)
{
low++;
}
k[high]=k[low];
}
k[low]=point;
return low;
}
void Qsort(int k[],int low,int high)
{
if(low<high)
{
int point=QPoint(k,low,high);
Qsort(k,low,point-1);
Qsort(k,po