Given a sorted Array of infinite length.. what is the most optimum way
to search for an element. We hane no idea about its length..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
exactly.. to implement suffix tree was out f my reach atleast during
the test. even thou i knew dat it ws d correct DS to use. i cudn't
actlly use it.
On Sep 19, 11:51 pm, hary rathor harry.rat...@gmail.com wrote:
can anybody tell about other approach because suffix tree is very thought to
Can some one please help me with this..
the problem is to find the longest substring in a list of around 100
strings..??
any idea..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
the strings and saving strings in str[],their length in
length and point it to next string_node
On Sun, Sep 18, 2011 at 4:47 PM, pooja pooja27tan...@gmail.com wrote:
Can some one please help me with this..
the problem is to find the longest substring in a list of around 100
i tried it for Windows.
#includeiostream
using namespace std;
int main()
{
char ch;
int i=system(dir /s |more);
ch=getchar();
}
On Sep 17, 6:46 pm, teja bala pawanjalsa.t...@gmail.com wrote:
you have to print the list of all the files in a directory and all
its sub
it's running..
http://ideone.com/XjGIo
wat is does is that through the system function u can run commands as
u do in command prompt.. nd dis is d command to show the files n all
as ur question asked.
try it on dev C++.
On Sep 17, 9:45 pm, teja bala pawanjalsa.t...@gmail.com wrote:
@ pooja
Professionals with extensive knowledge and experience, both in
training and development are a part of our team of trainers. Single
minded dedication, effective work culture and dynamic decision making
under impossible situations are our strengths. Quality without
compromise is our motto.
