montycheese / project-3-csci-2720 Goto Github PK

Please add your 810 number to the readme

I asked Karen again today; she said that we have to use the required data scale. I have changed the scale back as required.

Could you please compile DataGenerator.cpp and run the following commands on Nike again?

./DataGenerator 1
./DataGenerator 2
./DataGenerator 3

Three txt files will be generated. I will remake the plots as soon as you push the newly generated txt files to Github.

Thanks.

In the project instructions it asks:

"For merge sort and quick sort, the analysis process is essentially the same but you will use the function T(N) = c N lg N for the theoretical curve instead. Identify the values of c for merge sort and quick sort from your experimentation. Include those and their theoretical running time curve plots in your report."

I'm not sure how to derive this using R. Can you find those "c" values? She mentioned it would be as easy as trying arbitrary values until the upper-bound is satisfiable. I can add those to the report when we get them.

Did you test on your machine as

./DataGenerator 2
./DataGenerator 3

I pulled the latest version, but somehow still have the same problem as yesterday: merge and quick sort finish instantly but generate exact the same comparison number for 100 times.

DataGenerator is supposed to run as the followings, and a txt file containing the comparison time should be generated:

insertion sort

./DataGenerator 1

merge sort

./DataGenerator 2

quick sort

./DataGenerator 3

When I run DataGenerator on merge and quick sorting, a txt file is still generated. However, the comparison times are not corrected. The generated numbers are all the same. Could you please check your functions and test them using DataGenerator?

BTW, mergeSortOutput should have the function type as int and cmpNumber as int.