//code sketch based on greedy approach.
jumps(int hop,int n)
{
if(hop n)
{
return;
}
if(hop==n)
{
//path found
}
for(i=hop ; in i hop+arr[hop] ; i++)
{
jumps( (i+arr[i])-1 , n);
}
}
@above : call jumps(0,n-1);
On Sat, Jan 28, 2012 at 2:00 PM, atul anand atul.87fri...@gmail.com wrote:
//code sketch based on greedy approach.
jumps(int hop,int n)
{
if(hop n)
{
return;
}
if(hop==n)
{
//path found
abc(const char*p)
this means the string is const but pointer is not..
try this :-
//suppose intially it was p=hello
p=world; // this will work.
*p='e'; // compile time error
On Fri, Jan 27, 2012 at 6:08 PM, rahul sharma rahul23111...@gmail.comwrote:
is this a type of fxn overloadingit
I don't understand what you want to know be more precise but i think my
solution may help.
#includestring.h
#includestdio.h
int main()
{
union{
int a;
double b;
}u1={10.5};
union{
double a;
int b;
}u2={10.5};
printf(%d %f *%f %d*,u1.a,u1.b,u2.a,u2.b);
}
o/p : 10 0.00 10.500
I wanted to gather some analysis on parallelism for matrix multiplication.
Amdahl 's law essentially compares speed when work is done serially to
speed when some parallelism is introduced in the system.
Say I have Tcount threads used for computation on a system having NCores number
of cores. Say
it should be able to convert not only int but also float like 190.345 to
decimalcan ny one suggest thnx in advance
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
How QuickSort is good in Virtual Memory Enviroment ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
i wanna write the spell check function
like when we put some word with spelling mistake then it tell the most
suitable word matching to it( green error line of spelling in MS-Word)
i used levenshtein distance algorithm to find the subset from the
dictionary
but it is a linear search... and
one approach could be following :-
i have check MS-word and found out that for a given incorrect
wordswords suggested are of length = lenght(incorrect_word)+1 or to be
on a safer side take it as lenght(incorrect_word)+2.
we are assuming that we user is not making mistake greater that
@above : wrote in hurry..so ignore grammatical mistake. :P :P
On Sun, Jan 29, 2012 at 12:27 PM, atul anand atul.87fri...@gmail.comwrote:
one approach could be following :-
i have check MS-word and found out that for a given incorrect
wordswords suggested are of length =
check this blog
http://nlpb.blogspot.com/2011/01/spell-checker.html
On Sun, Jan 29, 2012 at 3:07 AM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
i wanna write the spell check function
like when we put some word with spelling mistake then it tell the most
suitable word matching to it( green
11 matches
Mail list logo
