《数据结构》-第十章 内部排序

第十章内部排序1023VOIDINSERT_SORT1SQLISTFORIK1II/从后向前逐个插入排序IFLRIKEYLRI1KEYLRK1KEYLRIKEY/监视哨FORJI1LRJKEYLRIKEYJLRJ1KEYLRJKEY/前移LRJ1KEYLRK1KEY/插入/INSERT_SORT11024VOIDBIINSERT_SORTSQLIST/辅助存储XLRKEYDXFIRST1FINAL1FORI2IX/插入前部FORJFINALDJLRIKEYJDJ1DJDJ1LRIKEYFINALELSE/插入后部FORJFIRSTDJLRILRINEXTPPQ/FOR/SLINSERT_SORT1026VOIDBUBBLE_SORT1INTA,INTN/对包含N个元素的数组A进行改进的冒泡排序CHANGEN1/CHANGE指示上一趟冒泡中最后发生交换的元素WHILECHANGEFORC0,I0IAI1AIAI1CI1/C指示这一趟冒泡中发生交换的元素CHANGEC/WHILE/BUBBLE_SORT11027VOIDBUBBLE_SORT2INTA,INTN/相邻两趟是反方向起泡的冒泡排序算法LOW0HIGHN1/冒泡的上下界CHANGE1WHILELOWAI1AIAI1CHANGE1HIGH/修改上界FORIHIGHILOWI/从下向上起泡IFAIAI1CHANGE1LOW/修改下界/WHILE/BUBBLE_SORT21028VOIDBUBBLE_SORT3INTA,INTN/对上一题的算法进行化简,循环体中只包含一次冒泡INTB3/B0为冒泡的下界,B2为上界,B1无用D1B00B2N1/D为冒泡方向的标识,1为向上,1为向下CHANGE1WHILEB00/注意这个交换条件AIAIDCHANGE1B1DD/修改边界D1/换个方向/WHILE/BUBBLE_SORT31029VOIDOE_SORTINTA,INTN/奇偶交换排序的算法CHANGE1WHILECHANGECHANGE0FORI1IAI1AIAI1CHANGE1FORI0IAI1AIAI1CHANGE1/WHILE/OE_SORT分析本算法的结束条件是连续两趟比较无交换发生1030TYPEDEFSTRUCTINTLOWINTHIGHBOUNDARY/子序列的上下界类型VOIDQSORT_NOTRECURVEINTSQLISTHIGHLLENGTHINITSTACKS/S的元素为BOUNDARY类型WHILELOW2/如果当前子序列长度大于3且尚未排好序PIVOTPARTITIONL,LOW,HIGH/进行一趟划分IFHIGHPIVOTPIVOTLOWPUSHS,PIVOT1,HIGH/把长的子序列边界入栈HIGHPIVOT1/短的子序列留待下次排序ELSEPUSHS,LOW,PIVOT1LOWPIVOT1/IFELSEIFLOWPIVOTKEYHIGHLRLOWLRHIGHWHILELOWLRHIGHKEYLRLOWLRHIGHELSE/子序列含有三个元素IFLRLOWKEYLRLOW1KEYLRLOWLRLOW1IFLRLOW1KEYLRHIGHKEYLRLOW1LRHIGHIFLRLOWKEYLRLOW1KEYLRLOWLRLOW1/EASY_SORT1031VOIDDIVIDEINTA,INTN/把数组A中所有值为负的记录调到非负的记录之前LOW0HIGHN1WHILELOW0HIGH/以0作为虚拟的枢轴记录ALOWAHIGHWHILELOWAHIGH/DIVIDE1032TYPEDEFENUMRED,WHITE,BLUECOLOR/三种颜色VOIDFLAG_ARRANGECOLORA,INTN/把由三种颜色组成的序列重排为按照红,白,蓝的顺序排列I0J0KN1WHILEJAJIJBREAKCASEWHITEJBREAKCASEBLUEAJAKK/这里没有J语句是为了防止交换后AJ仍为蓝色的情况/FLAG_ARRANGE分析这个算法中设立了三个指针其中,J表示当前元素I以前的元素全部为红色K以后的元素全部为蓝色这样,就可以根据J的颜色,把其交换到序列的前部或者后部1033VOIDLINKEDLIST_SELECT_SORTLINKEDLISTPNEXTNEXTPPNEXTQPNEXTXQDATAFORRQ,SQRNEXTRRNEXT/在Q后面寻找元素值最小的结点IFRNEXTDATANEXTDATASRIFSQ/找到了值比QDATA更小的最小结点SNEXTPNEXTSNEXTSNEXTQTQNEXTQNEXTPNEXTNEXTPNEXTNEXTT/交换Q和SNEXT两个结点/FOR/LINKEDLIST_SELECT_SORT1034VOIDBUILD_HEAPHEAPIHRKKEYHRJHRKJK/FOR/BUILD_HEAP1035VOIDTRIHEAP_SORTHEAPI0IHEAP_ADJUSTH,I,HLENGTHFORIHLENGTHI1IHR1HRIHEAP_ADJUSTH,1,I1/TRIHEAP_SORTVOIDHEAP_ADJUSTHEAPFORJ3S1JN1N1START2L1/注意END2可能超出边界MERGEA,START1,END1,START2,END2/归并/MERGE_SORTVOIDMERGEINTA,INTS1,INTE1,INTS2,INTE2/将有序子序列AS1到AE1和AS2到AE2归并为有序序列AS1到AE2INTBMAXSIZE/设立辅助存储数组BFORIS1,JS2,KS1INEXT,E2PPNEXTPE2FORI1,QPINEXTI,QQNEXTE1QFORI1INEXTI,QQNEXTE2Q/求出两个待归并子序列的尾指针IFE1E2LINKEDLIST_MERGEL,P,E1,E2/归并/LINKEDLIST_MERGE_SORT1VOIDLINKEDLIST_MERGELINKEDLISTRE1NEXT/Q和R为两个子序列的起始位置WHILEQE1NEXTPQQQNEXTELSEPNEXTRPRRRNEXT/WHILEWHILEQE1NEXT/接上剩余部分PNEXTQPQQQNEXTWHILERE2NEXTPNEXTRPRRRNEXT/LINKEDLIST_MERGE1038VOIDLINKEDLIST_MERGE_SORT2LINKEDLIST/设立一个数组来存储各有序子序列的尾指针FORPLNEXTNEXT,I0PPPNEXT/求各有序子序列的尾指针IFPNEXT|PDATAPNEXTDATAENDIPWHILEEND0NEXT/当不止一个子序列时进行两两归并J0K0/J当前子序列尾指针存储位置K归并后的子序列尾指针存储位置FORPLNEXT,E2PPNEXTPE2/两两归并所有子序列E1ENDJE2ENDJ1/确定两个子序列IFE1NEXTLINKEDLIST_MERGEL,P,E1,E2/归并ENDKE2/用新序列的尾指针取代原来的尾指针J2/转到后面两个子序列/WHILE/LINKEDLIST_MERGE_SORT2VOIDLINKEDLIST_MERGELINKEDLISTRE1NEXTWHILEQE1NEXTPQQQNEXTELSEPNEXTRPRRRNEXT/WHILEWHILEQE1NEXTPNEXTQPQQQNEXTWHILERE2NEXTPNEXTRPRRRNEXT/LINKEDLIST_MERGE,与上一题完全相同1039VOIDSL_MERGEINTA,INTL1,INTL2/把长度分别为L1,L2且L12AIBIGTELSEIFAJAMIN/与第I个记录交换CM