mvishnu2005
BAN USERDon't think statement one is true. To be clear compiler actually generates vtables for virtual method there could be compiler designed which doesn't implement vtable for virtual methods
 mvishnu2005 March 10, 2012So couple of strategies here
1. have an array of int from 1256 and increment the count of each bit for the corresponding hit
2. Convert them to a upper or lowerbase generate hash for the string  ofcourse the hash algo should be strong
3. Do a sort of the string and compare.
For a given range of number say 1 to n we can check for primeness in the following
ie isPrime(int n)
1. if number is 1 or if n % 2 == 0 (if a number is even )then return false
2. use the axiom that if n has divisor from 1<d < n then it has divisor 1< do < sqrt(n)
isPrime(int n )
{
if ( (n ==1)  (n %2 ) == 0 )
return false;
if(n ==2 )
return true;
for(int i=3; i<=(int)sqrt.(n) ; i++)
if(n %i ==0)
return false;
return true;
}

mvishnu2005
February 19, 2012 What is the use case for this scenarios when would we do this ?
 mvishnu2005 February 19, 2012
Repewasam940, Backend Developer at Absolute Softech Ltd
I am a 29yearold Investment Advisor from New York. I help people make the right investment decision. I met many ...
Repjesusitahyer, Data Engineer at ASAPInfosystemsPvtLtd
Hello Everyone, I am Jesusita and I am passionate about writing the stories about powerful mantra to get what you ...
A release build would generally have symbols stripped off and log levels are generally low.
 mvishnu2005 March 18, 2012