This link has been bookmarked by 67 people . It was first bookmarked on 22 Jan 2008, by Joel Liu.
-
08 Jan 09
Bez ThomasYou’re a network operator at a backbone ISP. Your world largely consists of “prefixes” —- IP network/netmask pairs. The netmasks in those prefixes are hugely important to you. For instance, 121/8 belongs to Korea; 121.128/10 belongs to Korea Telecom, 121.
-
30 Dec 08
-
28 Jun 08
benpjohnsonA sorted array suggests a different strategy: jump the middle of the array and see if the value you’re looking for is less than (to the left) or greater than (to the right). Repeat, cutting the array in half each time, until you find the value.
-
02 Mar 08
-
23 Feb 08
-
22 Feb 08
-
03 Feb 08
-
01 Feb 08
-
28 Jan 08
-
27 Jan 08
-
25 Jan 08
-
24 Jan 08
-
23 Jan 08
-
22 Jan 08
-
Ron WelchLazy sheep is cool.
algorithms programming datastructures Algorithm aguri tree computerscience
-
Jon (themightyjon)Nice little blog post about trees, searching, etc - binary trees, binary radix trees, and aguri heuristic - efficient ways to search, traverse and retrieve from large data structures.
cs aguri tree datastructures programming algorithm computerscience data search match regex dfa heuristic mask binary blog efficient efficiency source:delicious
-
Kalid Azad#
0.0.1.20 to go to “a”
#
You need packets for 10.0.1.21 to to to “b” -
gavino angn (to the left) or greater than (to the right). Repeat, cutting the array in half each time, until you find the value. Binary search. Given 10 numbers, it will take as many as 3 steps —- log2 of 10 —- to find one of them in a sorted array. O(log n) se
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.