Description: The application of the order form
(1) of length n given in Table A using the linear sequence of storage structure, please write a time complexity 0 (n), space complexity is 0 (1) of the algorithm to delete all the values of the linear form for the item of data elements. Requirements: n number of elements in a large linear table, while the number of data elements is very little item, requiring as little as possible the number of mobile elements to delete array element after the array elements do not have to maintain the original order of the same.
(2) write a function to a sequence of Table A (with n elements, and any element not 0) the order split into two tables, so that A is greater than 0 in the element is stored in B, is less than 0 elements stored in C.
(3) assuming an arithmetic expression contains parentheses, brackets, and three types of flower number in parentheses, the expression in parentheses write a discriminant function correctly matching correct (exp
To Search:
File list (Check if you may need any files):
数据结构程序设计\总.txt
数据结构程序设计
Download