I read the paper attached, but I am not really sure I understood what
makes the Bigtables score over other methods of data storage & access.
How exactly are they better than other data structures?
On Oct 2, 9:19 pm, Prabhu Hari Dhanapal
wrote:
> @ eKay , great question dude!
>
> It seems tha
Hi.
I need a computationally simple algorithm to generate a random series
of discrete values, i.e., I want to get a string of integers where
each integer is in the range from 1 to N where N is fairly small (less
than 100 for sure). Has to be simple enough to run on a
microcontroller unit. Doesn
The minimum circle will either touch 2 points that form a diameter, or
will touch 3 points that form an acute or right triangle. Your
algorithm can make a circle that touches only one point; thus it is
not a solution.
See
http://www.personal.kent.edu/~rmuhamma/Compgeometry/MyCG/CG-Applets/Center
okay...
perhaps
"It's a 2-player game that's deterministic, zero-sum, perfect
information, finite, and without ties. So a winning strategy exists
for one of the players."
should have been mentioned... I didn't know that.
Btw, what is the proof of the statement I just quoted?
thanks
On Oct 2, 7
try this
do the DFS analogous traversal on the tree.means
1.set level=1,push root
2.pop root
3.push both children on stack and set increment level .
4.now pop top and recursively do the same thing
every time u pop an element enque it in a max priority queue according to
level
when traver
nice
but what if its a generic tree .. I mean each node can have any no of
children 2,3,4 ,5
How do you traverse it from bottom to top then ??
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
I know this problem doesn't sound new, but it is new to me and I
thought I could get some of your insight into solving this.
There are some ~1000 points on a plane. We need to find the minimum
radius circle that can hold all these points.
a) What I thought is that, first of all we need to discar
Lets call each possible configuration(removing the symmetrical
duplicates) a "state".
How many such states of a Rubik's cube are possible?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
On 2 říj, 16:07, Manisha wrote:
> Traversing a binary tree from bottom to top
>
> The only way I could think of is:
> Traverse the binary tree from top to bottom, level by level with the
> help of queue.
> For a tree like:
> a
> b c
> d
