All Questions
3 questions
4
votes
1
answer
1k
views
What is the most suitable data structure for IPv4 addresses with intersecting ranges?
Mostly in all routers and operating systems the Longest Prefix Match algorithm is used for searching the trie of IPv4 addresses.
Packet filters like Iptables don't need some special data structure for ...
- 99
-2
votes
1
answer
772
views
Considerations when making data structure and algorithm choices [closed]
What are some reasons you may choose a worse runtime algorithm? And what are some advantages of a linked list vs a hash table/array where access is constant time.
- 99
1
vote
4
answers
214
views
What do polynomial algorithms entail?
From here, I know it is that an algorithm that...
...is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some ...
eltigre