Algorithms Profiler

According to Google's AI Assistant, a profiler is a dynamic program analysis tool that collects and measures data on a running application's performance, such as CPU usage, memory consumption, and execution time of different code sections.

You will be implementing your own profiler, this profiler will be used to initially measure time and memory usage of your programs. From now on, every new coding excercise will use this profiler, make sure you include it in all the programs. Later, we may add more features to your profiler as we see more algorithms in the class.

The first program to profile

The first program to profile will be the one assigned for search algorithms. General instructions can be found on this link.

Your program must be implemented in the provided .cpp and .h files. Please don't create new source code files. The main.cpp file is the one that will manage the command line arguments, and then, it will call the profiler and the chosen search algorithm.

You program will be tested with the following data file: integers.txt, floats.txt and strings.txt.

How your program will be tested

Manual Testing (please follow the given output format)

Below some examples of executions:

• Recursive Binary Search on integers.txt

./main --input integers.txt --recursive-binary-search --target 492170
Search Algorithm : Recursive Binary Search
Input File       : integers.txt
Data Values Type : Integers
Target Value     : 492170
Result           : Found

• Iterative Binary Search on floats.txt

./main --input floats.txt --binary-search --target 0.11086637989933112
Search Algorithm : Recursive Binary Search
Input File       : floats.txt
Data Values Type : Floats
Target Value     : 0.11086637989933112
Result           : Found

• Sequential Search on strings.txt

./main --input strings.txt --sequential-search --target t17sB7nJaj
Search Algorithm : Sequential Search
Input File       : strings.txt
Data Values Type : String
Target Value     : t17sB7nJaj
Result           : Found

With Automation (this is how the professor will test)

make test

Expected Output (of the profiler)

Your profiler will always print its output below at the end of your program common output. Below a sample output, you must follow this format, don't change it.

Consider that the output of the search algorithms will be at the beginning, take a look on previous sections for details.

====================================
| My Profiler    |  program_name   |
|----------------|-----------------|
| Execution Time | 125 nanoseconds |
| Memory Usage   | 1 MB            |
====================================

Grading Policy

Rubric	Points
Complete Profiler	50
Search Algorithms (3)	50
Total	100