i have the method that can calculate the elapsed fime
5. Apply the merge sort on the table below to show the time complexity of the No of Elements 100 Data Source (Random) String ("A", "B", "C"..."2") 1,000 Data Type String random length max length 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) String ("A", "B", "C"."2") 10,000 String ("A", "B", "C"."2") 80,000 int 100,000 200,000 500,000 1,000,000 int int int 100,000 double String ("A","8","C"."2") ") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double 5. Apply the merge sort on the table below to show the time complexity of the algorithm. No of Elements Data Source (Random) string ("A","B", "C".."2") Elapsed Time (ms) 100 1,000 String ("A", "B", "C"..."2") 10,000 Data Type String random length (maxlength 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) int int int int String ("A","B", "C"..."Z") 80,000 100,000 200,000 500,000 1,000,000 100,000 double String ("A","g","C"..."2") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double 5. Apply the merge sort on the table below to show the time complexity of the No of Elements 100 Data Source (Random) String ("A", "B", "C"..."2") 1,000 Data Type String random length max length 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) String ("A", "B", "C"."2") 10,000 String ("A", "B", "C"."2") 80,000 int 100,000 200,000 500,000 1,000,000 int int int 100,000 double String ("A","8","C"."2") ") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double 5. Apply the merge sort on the table below to show the time complexity of the algorithm. No of Elements Data Source (Random) string ("A","B", "C".."2") Elapsed Time (ms) 100 1,000 String ("A", "B", "C"..."2") 10,000 Data Type String random length (maxlength 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) int int int int String ("A","B", "C"..."Z") 80,000 100,000 200,000 500,000 1,000,000 100,000 double String ("A","g","C"..."2") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double
