数据结构作业（Data structure operation）.docVIP

数据结构作业（Data structure operation） The definition of the f (n) function (n as a natural number) is defined as follows: 1 (n=1) (F = n) 2*f (n/2) + n (n1) 1) write a recursive algorithm for calculating f (n). 2) use the stack to rewrite the non recursive algorithm. Subject of computer (three) --- stack experiment (2 hours) (two choose one) On Saturday morning, in the 1-2 quarter, the number of media 1 class 6308; 3-4 sections, the number of media 2 class 6308? 1. programming Hanoi problem recursive algorithm and non recursive algorithm, and statistics of their execution time. On the use of time functions: #include time.h #include stddef.h Time_t, start, end; Start=time (NULL); Hanoi (n,x,y,z); End=time (NULL); Printf (time =%f, seconds\n, difftime (end, start)); 2. expression evaluation Verify the correctness of an arithmetic expression. If it is correct, then calculate the value of the arithmetic expression. Solution: 1. Enter the value of the expression from the keyboard. 2. Analyze whether the expression is legal: (1) a number, which determines the validity of the number. If legal, the data storage stack is pressed. (2) the operators are defined, and they are processed according to the rules. In the process, the value of the expression is evaluated. (3) if other characters are returned, the error message is returned. 3. If no errors are found in the process, the expression is considered valid and the result is printed. Program job 2 Modify the program operation 1, the data structure is changed to the order table, to achieve the following functions: Create sequence table; Insert operation of a sequential table; Delete operation of sequential table; Display content in a sequential table; The above functions are implemented in function respectively. Program job 3 Change the data structure of program operation 2 to single linked list and add the following functions: Merge two ordered single linked lists; Take the value of the first I element in a single chain table; The