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 ??
Printable View
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 ??