Please do in java. Here is a new link of the data file that was zipped

https://www.dropbox.com/s/cy8tjmz09eehfzb/COSC2336Lab4.data?dl=0

try this one if the one on top doesnt work

https://drive.google.com/file/d/1RdjBb1jkDSk-e9-xGvP1-vfBeFfCv5Ir/view?usp=sharing

or if both don't open post your email in the comments and i will email you the zipped file

Input Data:

- Use the input data provided (Public data)

- Each record is public FM radio station

- Each record has 37 field delimited with "|"

- Note, this is a special RegEx characters, so it might need to be escaped...

- The data is sorted by station frequency (Many duplicates when using that key)

Design a sort analyzer:

- Read the datafile and organize in a way that we can have 3 different keys: frequency, name, market (Compound key made of Country|State|City)

- Minimaly modify the 3 simple sort algorithm provided in the book (And available @ http://algs4.cs.princeton.edu/)

* Algorithms: SelectionSort, InsertionSort, Shell

* To count compares and count swaps

* Sort using pointers, not keys! IE sort on name should not un-sort on market (Some algorithm from the book already have that)

- Sort on all 3 keys using all 3 algorithms - Make sure all sorts start from the same data (IE do not use the result of the previous sort, but how the data was read)

* that is a total of 3x3=9 sorts each producing results

* After every sort, display record # 20000 (That is how I will verify your modified sort works!)

- Repeat everyting 3 to compare results

- Display a tabular report with information for all 3 sort algorithms on 3 different keys:

* N

* Key

* Sort run time

* Number of compares

* Number of swap