Implement the Traverse Operations Using a Sorted Array

Assignment Task

You will implement the insert and find and traverse operations using a sorted array as the concrete data structure. After constructing the sorted array using repeated insert operations, you can then use find and traverse to find a key matching the prefix by using a binary search, you should then linearly search around this location to find adjacent values which also match the prefix until you have found all values matching the prefix.

Your Makefile should produce an executable program called dict2. This program should take three command line arguments.

1. The first argument will be the stage, for this part, the value will always be 2.

2. The second argument will be the filename of the data file.

3. The third argument will be the filename of the output file.

This Data Science has been solved by our PhD Experts at My Uni Paper.