Hi
Problem :-
finding out a string from a text file ( only in c/c++)
my code is taking timecomplexity as o(mn) in worst case.
where m is the size of the string and n is the size of the file.
can anyon suggest better approach ??
Hi
Problem :-
finding out a string from a text file ( only in c/c++)
my code is taking timecomplexity as o(mn) in worst case.
where m is the size of the string and n is the size of the file.
can anyon suggest better approach ??
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.