第一部分
第一套笔试题
T1. 如果数据经常要动态变化的,需要频繁维护最新的排序结果,用哪种排序效率最高?
A.堆排 B.插排 C.快排
参考答案:未知
T2.输出程序运行结果
public class TaskBGThread extends Thread {
private int i=1;
public void run()
{
System.out.print("TaskBG" + i);
i++;
}
}
TaskThread.java定义如下:
public class TaskThread implements Runnable {
private int i=1;
public void run()
{
System.out.print("Task" + i);
i++;
}
public static void main(String[] args) {
Runnable runner = new TaskThread();
Thread thTask1 = new Thread(runner);
thTask1.run();
Thread thTask2 = new Thread(runner);
thTask2.start();
Thread thTaskBG1 = new TaskBGThread();
thTaskBG1.start();
Thread thTaskBG2 = new TaskBGThread();
thTaskBG2.start();
}
}
参考答案:
T3.
参考答案:未知
T4.
参考答案:未知
T5.
#include <iostream>
void Print(int* a, int len) {
char* c = reinterpret_cast<char*>(a);
for (int i = 0; i < len * sizeof(int); ++i) {
c[i] -= '0';
}
for (int i = 0; i < len; ++i) {
std::cout << a[i] << std::endl;
}
}
int main()
{
char