Unformatted text preview: constant, so amortized cost is O(1). If the table is nearly full, or the input data is repeated, the insertion function will have to search through the table for an empty slot, so the actual cost will involve the cost of the insertion plus the cost of the search which will not necessarily be O(1)....
View
Full
Document
This note was uploaded on 11/07/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.
 Spring '09
 Dr.Ayman
 Algorithms

Click to edit the document details