数据结构与算法分析语言描述答案weis习题ch03.pdfVIP

Chapter 3: Lists, Stacks, and Queues 3.2 The comments for Exercise 3.4 regarding the amount of ness used apply here. The running time of the procedure in Fig. 3.1 is O (L + P ). _______________________________________________________________________________ _______________________________________________________________________________ void PrintLots( List L, List P ) { int Counter; Position Lpos, Ppos; Lpos = First( L );