数据结构题目（Data structure title）.docVIP

数据结构题目（Data structure title） There is a set of initial record key sequences (K1, K2),... , Kn), required to design an algorithm to O (n) time complexity in the linear table is divided into two parts, the left part of each keyword is less than Ki, each keyword of the right part are greater than or equal to Ki. Void QuickPass (int, r[], int, s, int, t) { Int, i=s, j=t, x=r[s]; While (ij) { While (ij and r[j]x) j=j-1 if (ij); {r[i]=r[j]; i=i+1;} While (ij and r[i]x) i=i+1 if (ij); {r[j]=r[i]; j=j-1;} } R[i]=x; } There is only a single data element of three types of characters in the table (uppercase letters, numbers and other characters), using the original node space in a single list designed three single table algorithm, so that each single list contains only the similar character. Typedef char datatype; Typedef, struct, node, {datatype, data; struct, node, *next;}lklist; Void, split (lklist, *head, lklist, *ha, lklist, *hb, lklist, *hc) { Lklist *p; ha=0, hb=0, hc=0; For (p=head; p; =0; p=head) { Head=p-next; p-next=0; If (p-data=Aand p-data=Z) {p-next=ha; ha=p;} Else if (p-data=0and p-data=9) {p-next=hb; hb=p; else {p-next=hc hc=p;}}; } } ? data elements contain 3 characters of 7. known is represented by a linear list in a linear list (e.g., letters, numbers and other characters), try to write the algorithm of linear table is divided into 3 circular linked list, the linear table in each cycle list that only contains one kind of character Status LinkList_Divide (LinkList, L, CiList, A, CiList, B, CiList, C) ? / / single linked list L is divided into three types according to the elements of.CiList circular linked list head node type circular linked list {s=L-next; A= (CiList*) malloc (sizeof (CiLNode)); p=A; B= (CiList*) malloc (sizeof (CiLNode)); q=B; C= (CiList*) malloc (sizeof (CiLNode)); r=C; The establishment of the first node / /? ? While (s) {if (=s-data = a s-data Z || ? A =s-data s-data Z) {p-next=s; p=s;} Else if (=s-data s-data = 0 9) {q-next=s; q=s;}