Thursday, February 12, 2009

Time complexity - Omega of data structures

a) 2-4 tree - O(logn) [Omega logarithmic n]
at

No comments:

Post a Comment