下面是常用到的一些面试题,不对的地方求纠正:
(1)排序 插入法
(2)排序冒泡法
(3)希尔排序
(4)二分查找法
int BinSearch1(int r[ ], int n, int k)
//数组r[1] ~ r[n]存放查找集合
{
low=1; high=n;
while (low<=high)
{
mid=(low+high)/2;
if (k<r[mid]) high=mid-1;
else if (k>r[mid]) low=mid+1;
else return mid;
}
return 0;
}
(5)十进制转二进制
char *dec_to_bin(int _input, char *_output, int _len)
{
int n = _input, i = 0, j = 0;
int a[_len];
while (n > 0)
{
a[i] = n % 2;
i = i + 1;
n = n / 2;
}
for (i--; i >= 0; i--)
_output[j++] = (char)(a[i] + '0');
return _output;
}
(6)字符串copy
(7)字符串反转