insert, update, search, delete in k(n) time where
k is a constant = average size of token (key)
n is the number of tokens to be sorted
Time Complexity(big O): = O(n)
( cf binary tree: = O(nlogn) )
Be the first to post a review of newmansort!