Ques .... Given a large text... in the text.. there are > , < etc
representing > and <.....(there can be others like &eq; etc)
the task is to replace such (>) with the '>' symbol...
and (<) with '<'
given the table which have corresponding matches... and
table is finite .
suggest an efficient algo...
--
Regards,
G C
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
