Get Instant Help From 5000+ Experts For
question

Writing Get your essay and assignment written from scratch by PhD expert

Rewriting: Paraphrase or rewrite your friend's essay with similar meaning at reduced cost

Editing:Proofread your work by experts and improve grade at Lowest cost

loader
Phone no. Missing!

Enter phone no. to receive critical updates and urgent messages !

Add File

Error goes here

Files Missing!

Please upload all relevant files for quick & complete assistance.

Guaranteed Higher Grade!

Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort

7 Pages / 1,602 Words Published On: 16-01-2021

In this coursework, you are to carry out an analysis of two different versions of the merge-sort algorithm by performing a number of experiments.  You will present the results of these experiments in a short report that relates the results to the theoretical performance for both versions of the algorithm.  

Implement the recursive merge-sort algorithm which was introduced in lectures, and measure its performance for different sizes of array to be sorted.To measure its performance you should measure:

  • the number of comparisons it performs
  • the number of copies it performs
  • the number of recursive calls.

Experimental method

  • How were the experiments performed?  
  • What sort of data was used?
  • How was that data generated to test average case performance?
  • How was that data generated to test worst case performance?
  • Include a description of how the two versions of the merge-sort algorithm were tested
  • Results of the first experiment
  • how does the number of operations vary with different sizes of arrays used, include tables to show the data obtained showing counts of copies and comparisons required. Include appropriate graphs to illustrate the results.

Analysis of results

  • State what the theoretical performances of the algorithms for the two experiments should be under average and under worst-case scenarios
  • Comparison between the results and the theoretical performances of the algorithms for the two experiments
  • Your analysis should demonstrate convincingly and rigorously any conclusions you make about whether the results match theory
  • Comparisons between the two methods
Cite This Work

To export a reference to this article please select a referencing stye below:

My Assignment Help. (2021). Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort. Retrieved from https://myassignmenthelp.com/free-samples/cm2100-advanced-software-design-and-development/theoretical-performances-of-the-algorithms.html.

"Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort." My Assignment Help, 2021, https://myassignmenthelp.com/free-samples/cm2100-advanced-software-design-and-development/theoretical-performances-of-the-algorithms.html.

My Assignment Help (2021) Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort [Online]. Available from: https://myassignmenthelp.com/free-samples/cm2100-advanced-software-design-and-development/theoretical-performances-of-the-algorithms.html
[Accessed 03 October 2023].

My Assignment Help. 'Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort' (My Assignment Help, 2021) <https://myassignmenthelp.com/free-samples/cm2100-advanced-software-design-and-development/theoretical-performances-of-the-algorithms.html> accessed 03 October 2023.

My Assignment Help. Analysis Of Two Merge-Sort Algorithms: Recursive And Iterative Merge-Sort [Internet]. My Assignment Help. 2021 [cited 03 October 2023]. Available from: https://myassignmenthelp.com/free-samples/cm2100-advanced-software-design-and-development/theoretical-performances-of-the-algorithms.html.


Stuck on Any Question

Our best expert will help you with the answer of your question with best explanation.

question

Writing: Get your essay and assignment written from scratch by PhD expert

Rewriting: Paraphrase or rewrite your friend's essay with similar meaning at reduced cost

Editing: Proofread your work by experts and improve grade at Lowest cost

question
We will use e-mail only for:

arrow Communication regarding your orders

arrow To send you invoices, and other billing info

arrow To provide you with information of offers and other benefits

Phone no. Missing!

Enter phone no. to receive critical updates and urgent messages !

loader
250 words
Error goes here

Error goes here

Files Missing!

Please upload all relevant files for quick & complete assistance.

icon
5% Cashback

On APP - grab it while it lasts!

Download app now (or) Scan the QR code

*Offer eligible for first 3 orders ordered through app!

screener
ribbon
callback request mobile
Have any Query?
close
Subtraction Payment required!

Only one step away from your solution of order no.