This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n = (20)(8) / (4 + 8) = 13 1 3 . So, the linked list is more ef f cient when 13 or fewer elements are stored. (b) Since E = 2 , P = 4 , and D = 30 , the breakeven point occurs when n = (30)(2) / (2 + 4) = 10 . So, the linked list is more ef f cient when less than 10 elements are stored. (c) Since E = 1 , P = 4 , and D = 30 , the breakeven point occurs when n = (30)(1) / (1 + 4) = 6 . So, the linked list is more ef f cient when less than 6 elements are stored. (d) Since E = 32 , P = 4 , and D = 40 , the breakeven point occurs when n = (40)(32) / (32 + 4) = 35 . 5 . So, the linked list is more ef f cient when 35 or fewer elements are stored....
View
Full
Document
This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.
 Fall '08
 BELL,D

Click to edit the document details