• Stars
    star
    4
  • Rank 3,304,323 (Top 66 %)
  • Language
    C++
  • Created over 7 years ago
  • Updated over 7 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Sequential IP address lookup in the routing table of routers has complexity O(n). This lookup can be reduced to O(1) time complexity, trading of with the space complexity which can be exponential in the worst case i.e. exp(2,33) - 1 on implementing tries.

More Repositories