I haven't any problems, just i like to know what kinda algos use to create
path finding in _city map_, how to define map data, like nodes? (x, y),
street have : street start x, start y, and street end x, end y, and homes
near street just nodes from street?
But how then with streets whom is like
most of the db applications tend to heavily perform range queries which
btrees are excellent for.
range queries are something like
select * from my_table where age 30 etc
just for fetching exact values (==) hash tables are still faster by using
hash functions like md5. amount of data doesnt
OpenGL is graphics library available for public and commercial use. Mostly
this library is used to create graphics and window based applications in
C++. This can be an alternate of microsoft products directX vc.
The scope of this Library is very broad in all non microsoft plateforms like
linux
Hi
I have to devlop a graphic simulation project in which i hav to
build a graphics engine .
wht does it mean???
On 4/19/07, monty 1987 [EMAIL PROTECTED] wrote:
hi,
Can anyone tell me more about open gl .How is the scope for this
topic??
Linear time isn't enough. Think about what the term 'subsequence' means.
Muntasir
- Original Message -
From: Hari Nathan
To: algogeeks@googlegroups.com
Sent: Tuesday, April 17, 2007 9:52 AM
Subject: [algogeeks] Re: algo problem
Isn't linear time enough? Go form the
Yup dudes I agree it was a wrong program I have put the
proper indentation without proper braces and that makes the code
incorrect.
The correct program would be :
int getheight ( node *p )
{
if ( p==NULL )
return 0;
else
{
rh = getheight ( p-right );
I would also like to visit such a site. Its been quite frustrating
trying out problems for hours only to find out that nowhere can you
get the correct solution.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
There is no perfect hash function that will give an unique location
every time it is called. So BTrees will be faster no doubt.
Also note that with BTrees (or B+Trees) it is easier to retrieve data
filtered on range(s) of keys.
--~--~-~--~~~---~--~~
You received
Hi,
I want to read a PDF file contents and want to print that in a text
file...i.e if a PDF file contains abcd i want to read that and store in
text file..
i think we can face problem in knowing how much bytes the PDF header has and
etcdoes any know that please help
thanks in
