Urgent Fast project, complexity - Trivial
Simple C programming, for a Linux shell (Ubuntu)
Consider a TEXT file of great dimensions which needs completion of a search function.
1 - We need a set of functions that implements searching algorithms (Any of the classic search algorithms) that will act on a specified portion of the TEXT file. These are identified by offset (in relation with the start of the file) and length of the segment.
2 - With that function implement an application that is capable of searching a TEXT offered at stdin, the search being made on segments of size specified by the user beforehand. The Application must use the fork() mechanism or fire for execution, whatever between the two, For this the application must return the FIRST or ALL of the occurrences of the searched text.
This is a very urgent project but its complexity and time needed to be built is really small.
This has to be completed in less then 24h.