Hi there...the algo u suggested would run in O(n-square) i guess....It is much better u hash the values as i told...is there anything wrong in my implementation...please correct me...
cheers :)
Type: Posts; User: jawahar
Hi there...the algo u suggested would run in O(n-square) i guess....It is much better u hash the values as i told...is there anything wrong in my implementation...please correct me...
cheers :)
hi there.....
yeah....the decrement operator u used made the difference...
while(--n) f*=n;
would fix the error(guess )
cheers :)
yeah... :) :)....this is an overhead to CPU....it is doing nothing just eating away the cycles by noops :)...i was just looking at DELAY...that's wat i was tellin...time interval cannot be specified...
yeah....this is a better design..... :)
cheers :)
yeah....suppose
int freq[256]; ////possible alll characters....u might restrict the limit if u r using fixed set of chars
for(int i=0;i<length;i++)
freq[(int)s.at(i)]++
this will count...
yeah....zacs7 is rite...if u r using some TurboC or some compiler which doesn't support this system call then u can simply loop up null statement for undefined interval of time...I mean, the time...
yeah...that's cool....now i have a problem in this....suppose am using this linked list with the definition provided...it is really very good as it is holding the addresses instead of data....so any...
yeah....instead of using feof it is better to use
while( (ch=fgetc(from))!=EOF)
this even avoids the over head of calling the function everytime...
cheers :)
hi ppl..thanx for the posts.....
Cheers :)
hi....as you are interested in getting values of range [0,8]...wat i would suggest is maintain an array of that size...
#define MAX 10
int array[MAX];
now,wat u have to do is some what...
Hi ppl...
Am very much new to this forum.I just learning C++...wanna clarify whether there is default object for any c++ class as in java or not!!!???