promote the extension of strictly administering the party grass-roots, but also the educational practice of the mass line of the party and three-three special education results achieved further inherited and expanded. To realize two a learning education is a necessary solution to the present problems of party construction. Strengthen problem consciousness and insisted on problem-oriented, is full of strictly administering the party since the partys 18 a distinctive feature, a successful experience. Secretary Wang noted that some party members still have political awareness, lack of political responsibility issues, party awareness and consciousness of the problem belief does not really believe, slim does not actually fix problems, outspoken, and jump on the assessment of the partys policies, and so on. Bi Lifu Secretary pointed out that a quarter of the economic situation is very serious, there is pressure on environment, seasonal factors and other objective reasons, but mainly subjective problem, is the problem of party members and cadres. Some depressed, negative slack, not responsible, . Double six, one, and two took the lead, build energy burst, Hongshan district, economic prosperity, eco-livable, civilized and harmonious island. It certainly can not be separated from the whole area 646 grass-roots party organizations and 14,146 members of broad participation and support. Through the two study and education, so that every cell of the party health, every organization is strong, so that all members of the vanguard and exemplary role, all the fighting bastion role of grass-roots party organizations into full play so that we can cross the Rapids, overcome all difficulties and the smooth realization of the Thirteen-Five goal. Second, basic learning, focus on learning education must understand the learning content and learning styles Foundation learning these four words are important information inside is very large, capture profound work truth in life. For example, I often say that the good Carpenter NAO Carpenter, why do some carpenters made furniture to have everybody likes it, Carpenter we are not willing to look for him? are apparently two people high and low technology, dig into the deep is firmer when both of his apprentices are not solid, there is no good that way. Luban art of story primary school are learn had, first after six mark test practice conduct, and practice cultivation, and practice perseverance, and practice patience, then with seven days seven night mill axe theory armed, and unity action, seriously learning XI General Secretary on reform development stable, and Interior diplomatic defense, and rule party ruling army of important thought, seriously learning to XI comrade for General Secretary of Central ruling acting political new concept new thought new strategy, seriously learning XI General Secretary study in Inner Mongolia important speech spirit, Guide party members and a deep understanding of a series of important speeches rich connotation and core ideas, which began so thoroughly Marxist positions 第10章 排序一、选择题1某内排序方法的稳定性是指( )。 【南京理工大学 1997 一、10（2分）】A该排序算法不允许有相同的关键字记录 B该排序算法允许有相同的关键字记录C平均时间为0（n log n）的排序方法 D以上都不对 2下面给出的四种排序法中( )排序法是不稳定性排序法。【北京航空航天大学 1999 一、10 （2分）】 A. 插入 B. 冒泡 C. 二路归并 D. 堆积3下列排序算法中，其中（ ）是稳定的。 【福州大学 1998 一、3 (2分)】A. 堆排序，冒泡排序 B. 快速排序，堆排序 C. 直接选择排序，归并排序 D. 归并排序，冒泡排序4稳定的排序方法是（ ） 【北方交通大学 2000 二、3（2分）】A直接插入排序和快速排序 B折半插入排序和起泡排序C简单选择排序和四路归并排序 D树形选择排序和shell排序5下列排序方法中，哪一个是稳定的排序方法？（ ） 【北方交通大学 2001 一、8（2分）】A直接选择排序 B二分法插入排序 C希尔排序 D快速排序6若要求尽可能快地对序列进行稳定的排序，则应选（A快速排序 B归并排序 C冒泡排序）。【北京邮电大学 2001 一、5（2分）】7如果待排序序列中两个数据元素具有相同的值，在排序前后它们的相互位置发生颠倒，则称该排序算法是不稳定的。（ ）就是不稳定的排序方法。【清华大学 1998 一、3 (2分）】A起泡排序 B归并排序 CShell排序 D直接插入排序 E简单选择排序8若要求排序是稳定的，且关键字为实数，则在下列排序方法中应选（ ）排序为宜。A直接插入 B直接选择 C堆 D快速 E基数 【中科院计算所 2000 一、5（2分）】9若需在O(nlog2n)的时间内完成对数组的排序，且要求排序是稳定的，则可选择的排序方法是（ ）。 A. 快速排序 B. 堆排序 C. 归并排序 D. 直接插入排序【中国科技大学 1998 二、4（2分）】 【中科院计算所 1998 二、4（2分）】10下面的排序算法中，不稳定的是（ ） 【北京工业大学 1999 一、2 (2分)】A.起泡排序 B.折半插入排序 C.简单选择排序 D.希尔排序 E.基数排序 F.堆排序。11下列内部排序算法中： 【北京工业大学 2000 一、1 (10分 每问2分)】A快速排序 B.直接插入排序 C. 二路归并排序 D. 简单选择排序 E. 起泡排序 F. 堆排序（1） 其比较次数与序列初态无关的算法是（ ） （2）不稳定的排序算法是（ ）（3）在初始序列已基本有序（除去n个元素中的某k个元素后即呈有序，kn）的情况下，排序效率最高的算法是（ ）（4）排序的平均时间复杂度为O(nlogn)的算法是（ ）为O(nn)的算法是（ ）12排序趟数与序列的原始状态有关的排序方法是( )排序法。【北京航空航天大学 1999 一、9（2分）】 A插入 B. 选择 C. 冒泡 D. 快速13下面给出的四种排序方法中，排序过程中的比较次数与排序方法无关的是。( )A选择排序法 B. 插入排序法 C. 快速排序法 D. 堆积排序法【北京航空航天大学 2000 一、10（2分）】14对下列四种排序方法，在排序中关键字比较次数同记录初始排列无关的是( )。A直接插入 B. 二分法插入 C. 快速排序 D. 归并排序 【南京理工大学 2000 一、7 （1.5分）】15在下列排序算法中,哪一个算法的时间复杂度与初始排序无关（ ）。【北京理